Hybrid Algorithms for Hybrid Flow Shop Scheduling considering Limited Buffers and Due Dates

Yanhui Yu; Tieke Li
May 2013
Advances in Information Sciences & Service Sciences;May2013, Vol. 5 Issue 10, p861
Academic Journal
The mode of continuous casting and hot charge rolling can be abstracted as a kind of two-stage HFS problem with limited buffers and due dates. Based on the analysis from a new angle, a hybrid algorithm, which includes heuristic repairing and neighborhood search, is proposed. Jobs are processed by heuristic rules, the starting time of jobs are repaired using the rules of reducing the idle time in buffers and minimizing the tardiness. At last, the neighborhood search is performed to improve objectives. Experiments show that the hybrid algorithm is feasible and effective.


Related Articles

  • Flowshop scheduling with interstage job transportation. Zhong, Weiya; Chen, Zhi-Long // Journal of Scheduling;Aug2015, Vol. 18 Issue 4, p411 

    There are a variety of joint job production and transportation scheduling problems that arise in modern manufacturing systems. In this paper, we study two such problems that arise in a flowshop environment where there are two processing stages and a single transporter that is available to...

  • A multi-start tabu search method for a single-machine scheduling problem with periodic maintenance and sequence-dependent set-up times. Pacheco, Joaquín; Ángel-Bello, Francisco; Álvarez, Ada // Journal of Scheduling;Dec2013, Vol. 16 Issue 6, p661 

    In this paper we study a problem of sequencing jobs in a machine with programmed preventive maintenance and sequence-dependent set-up times. The problem combines two NP- hard problems, so we propose a heuristic method for solving it, which hybridizes multi-start strategies with Tabu Search. We...

  • Scheduling the two-machine open shop problem under resource constraints for setting the jobs. Oulamara, Ammar; Rebaine, Djamal; Serairi, Mehdi // Annals of Operations Research;Dec2013, Vol. 211 Issue 1, p333 

    This paper addresses the problem of open shop scheduling on two machines with resources constraints. In the context of our study, in order to be executed, a job requires first, for its preparation for a given period of time, a number of resources which cannot exceed a given resource capacity....

  • A heuristic algorithm for the distributed and flexible job-shop scheduling problem. Ziaee, Mohsen // Journal of Supercomputing;Jan2014, Vol. 67 Issue 1, p69 

    The distributed manufacturing takes place in a multi-factory environment including several factories, which may be geographically distributed in different locations, or in a multi-cell environment including several independent manufacturing cells located in the same plant. Each factory/cell is...

  • A fast heuristic algorithm for solving parallel-machine job-shop scheduling problems. Gholami, Omid; Sotskov, Yuri // International Journal of Advanced Manufacturing Technology;Jan2014, Vol. 70 Issue 1-4, p531 

    We consider a multistage processing system, which includes both identical (parallel) machines that can process the same set of operations and different machines that can process only different operation sets. A release time r is given for each job J to be processed. For such a processing system,...

  • A heuristic for no-wait flow shop scheduling. Sapkal, Sagar U.; Laha, Dipak // International Journal of Advanced Manufacturing Technology;Sep2013, Vol. 68 Issue 5-8, p1327 

    This paper presents an efficient heuristic method to minimize total flow time in no-wait flow shop scheduling. It is based on the assumption that the priority of a job in the initial sequence is given by the sum of its processing times on the bottleneck machines. Empirical results demonstrate...

  • A Local Search Algorithm for the Flow Shop Scheduling Problem with Release Dates. Ren, Tao; Guo, Meiting; Lin, Lin; Miao, Yunhui // Discrete Dynamics in Nature & Society;3/19/2015, Vol. 2015, p1 

    This paper discusses the flow shop scheduling problem to minimize the makespan with release dates. By resequencing the jobs, a modified heuristic algorithm is obtained for handling large-sized problems. Moreover, based on some properties, a local search scheme is provided to improve the...

  • Optimization of Permutation Flow Shop with Multi-Objective Criteria. R., Pugazhenthi; Xavior M., Anthony // International Journal of Applied Engineering Research;2013, Vol. 8 Issue 15, p1807 

    The flowshop scheduling is concerned with allocation of available resources over a period of time with an optimum objective. The objective may be one or more like minimizing makespan, idle time and/or total flow time. Many researchers proposed various algorithms to achieve these objectives...

  • Optimization of Makespan in Flow Shop Scheduling Problems using Combinational NEH Family of Heuristics-An Analysis. Baskar, A.; Xavior M., Anthony // International Journal of Applied Engineering Research;2013, Vol. 8 Issue 10, p1205 

    Minimizing the total completion time (makespan) is an important job for a shop floor engineer so that all the jobs are completed before the due date. For smaller problems involving a few machines and jobs, finding an optimal sequence and its corresponding makespan is comparatively easier....


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics