Heuristic for scheduling in a two-machine bicriteria dynamic flowshop with setup and processing times separated

This paper addresses the two-machine bicriteria dynamic flowshop problem where setup time of a job is separated from its processing time and is sequenced independently. The performance considered is the simultaneous minimization of total flowtime and makespan, which is more effective in reducing the total scheduling cost compared to the single objective. A frozen-event procedure is first proposed to transform a dynamic scheduling problem into a static one. To solve the transformed static scheduling problem, an integer programming model with N 2 + 5N variables and 7N constraints is formulated. Because the problem is known to be NP-complete, a heuristic algorithm with the complexity of O (N 3) is provided. A decision index is developed as the basis for the heuristic. Experimental results show that the proposed heuristic algorithm is effective and efficient. The average solution quality of the heuristic algorithm is above 99%. A 15-job case requires only 0.0235 s, on average, to obtain a near or even optimal solution.

[1]  Sunderesh S. Heragu,et al.  A combined branch-and-bound and genetic algorithm based approach for a flowshop scheduling problem , 1996, Ann. Oper. Res..

[2]  Funda Sivrikaya-Serifoglu,et al.  A bicriteria two-machine permutation flowshop problem , 1998, Eur. J. Oper. Res..

[3]  S. L. Velde Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation , 1991 .

[4]  E. Ignall,et al.  Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .

[5]  Serpil Sayin,et al.  A bicriteria approach to the two-machine flow shop scheduling problem , 1999, Eur. J. Oper. Res..

[6]  Chandrasekharan Rajendran,et al.  Heuristics for scheduling in a flowshop with setup, processing and removal times separated , 1997 .

[7]  Li Lin,et al.  A dynamic job shop scheduling framework: a backward approach , 1994 .

[8]  Kenneth Steiglitz,et al.  Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n/2/F/ F , 1975, JACM.

[9]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[10]  Katsundo Hitomi,et al.  Optimal Two-Stage Production Scheduling with Setup Times Separated , 1979 .

[11]  Dileep R. Sule,et al.  Sequency on two and three machines with setup, processing and removal times separated , 1983 .

[12]  Teofilo F. Gonzalez,et al.  Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..

[13]  Chandrasekharan Rajendran,et al.  Two-Stage Flowshop Scheduling Problem with Bicriteria , 1992 .

[14]  Ali Allahverdi,et al.  Total flowtime in no-wait flowshops with separated setup times , 1998, Comput. Oper. Res..

[15]  Han Hoogeveen,et al.  Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems , 1992, Math. Program..

[16]  G. Rand Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

[17]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[18]  Xiaoyan Zhang,et al.  A heuristic approach to n/m job shop scheduling: Fuzzy dynamic scheduling algorithms , 1996 .

[19]  Willem Selen,et al.  A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling Problem , 1986 .

[20]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[21]  Tapan Sen,et al.  Job lateness in a two-machine flowshop with setup times separated , 1991, Comput. Oper. Res..

[22]  Ali Allahverdi,et al.  Scheduling in stochastic flowshops with independent setup, processing and removal times , 1997, Comput. Oper. Res..