Heuristic for no-wait flow shops with makespan minimization

No-wait or constrained flow shops with makespan minimization are considered in this paper. An Objective Increment method is introduced to judge whether or not a new schedule is better than its parent. The judgment is made just by the makespan increment rather than by the traditional method to compute the whole makespan, and the time complexity of a heuristic can be decreased by one order. As a new schedule is usually generated by insertion or pair wise exchanging, objective increments are analysed for the fundamental operations. A composite heuristic is proposed for the problems considered. Experimental results show that the proposed approach outperforms the best existing algorithms with the least CPU time.

[1]  Jose M. Framiñan,et al.  Comparison of heuristics for flowtime minimisation in permutation flowshops Technical report IO-2003 / 01 Version 0 . 5 Last version : 26 / 07 / 2003 , 2004 .

[2]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[3]  Sanja Petrovic,et al.  Inter-agent cooperation and communication for agent-based robust dynamic scheduling in steel production , 2004, Advanced Engineering Informatics.

[4]  C. Rajendran,et al.  An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs , 1997 .

[5]  Q. Wang,et al.  Efficient composite heuristics for total flowtime minimization in permutation flow shops , 2009 .

[6]  Ali Allahverdi,et al.  New heuristics to minimize total completion time in m-machine flowshops , 2002 .

[7]  J. Framiñan,et al.  An efficient constructive heuristic for flowtime minimisation in permutation flow shops , 2003 .

[8]  Ali Allahverdi,et al.  New heuristics for no-wait flowshops to minimize makespan , 2003, Comput. Oper. Res..

[9]  A. S. Spachis,et al.  Heuristics for flow-shop scheduling , 1980 .

[10]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[11]  Weiming Shen,et al.  iShopFloor: an Internet-enabled agent-based intelligent shop floor , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[12]  Chandrasekharan Rajendran,et al.  A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan , 1994 .

[13]  C. Rajendran,et al.  Heuristic algorithms for scheduling in the no-wait flowshop , 1993 .

[14]  Rebecca Y. M. Wong,et al.  N* - an agent-based negotiation algorithm for dynamic scheduling andn rescheduling , 2003, Adv. Eng. Informatics.

[15]  Weiming Shen,et al.  Distributed Manufacturing Scheduling Using Intelligent Agents , 2002, IEEE Intell. Syst..