An improved scheduling heuristic algorithm for no-wait flow shops on total flow time criterion

ICECT 2011 - 2011 3rd International Conference on Electronics Computer Technology

Volumn 3, Issue , 2011, Pages 159-163

  Sapkal, Sagar U ^a   Laha, Dipak ^a  

^a JADAVPUR UNIVERSITY   (India)

Author keywords

combinatorial optimization; heuristic algorithm; no wait flow shops; scheduling; total flow time

Indexed keywords

BOTTLENECK MACHINES; COMPUTATIONAL RESULTS; CONSTRUCTIVE HEURISTIC; CPU TIME; HEURISTIC PROCEDURES; NO-WAIT FLOW SHOP; NP-HARD; PROCESSING TIME; SCHEDULING HEURISTIC ALGORITHMS; TOTAL FLOWTIME;

COMBINATORIAL OPTIMIZATION; HEURISTIC ALGORITHMS; HEURISTIC METHODS; MACHINE SHOP PRACTICE; MACHINE SHOPS;

SCHEDULING ALGORITHMS;

EID: 79961244986     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICECTECH.2011.5941822     Document Type: Conference Paper

References (29)

1. Hall N.G., Sriskandarajah C., "A survey of machine scheduling problems with blocking and no-wait in process," Opeations Research, vol. 44, pp. 510-525, 1996.
2. Röck H., "The three-machine no-wait flow shop is NP-complete," Journal of Associate Computer Machinery, vol. 31, pp. 336-345, 1984.
3. Aldowaisan T., Allahverdi A., "New heuristics for no-wait flowshops to minimize makespan," Computers and Operations Research, vol. 30, pp. 1219-1231, 2003.
4. Grabowski J., Pempera J., "Some local search algorithms for no-wait flow-shop problem with makespan criterion," Computers and Operations Research, vol. 32, pp. 2197-2212, 2005.
5. Liu B., Wang L., Jin Y.H., "An effective hybrid particle swarm optimization for no-wait flow shop scheduling" International Journal of Advanced Manufacturing Technology, vol. 31, pp. 1001-1011, 2007.
6. Pan Q.K., Tasgetiren M.F., Liang Y.C., "A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem" Computers and Operations Research, vol. 35, pp. 2807-2839, 2008.
7. Pan Q.K., Wang L., Tasgetiren M.F., Zhao B.H., "A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion," International Journal of Advanced Maufacturing Technology, vol. 38, pp. 337-347, 2008.
8. Chen C., Neppalli V., Aljaber N., "Genetic algorithms applied to the continuous flow shop problem," Computers and Industrial Engineering, vol. 30, pp. 919-929, 1996.
9. Fink A., Voß S., "Solving the continuous flow-shop scheduling problem by metaheuristics," European Journal of Operational Research, vol. 151, pp. 400-414, 2003.
10. Kumar A., Prakash A., Shankar R., Tiwari M.K., "Psychoclonal algorithm based approach to solve continuous flowshop scheduling problem," Expert Systems Applications, vol. 31, pp. 504-514, 2006.
11. Reddi S.S., Ramamoorthy C.V., "On the flow-shop sequencing problem with no wait in process," Operational Research Quarterly, vol. 23, pp. 323-331, 1972.
12. Wismer D.A., "Solution of the flowshop-scheduling problem with no intermediate queues," Operations Research, vol. 20, pp. 689-697, 1972.
13. Bonney M.C., Gundry S.W., "Solutions to the constrainted flowshop sequencing problem," Operational Research Quarterly, vol. 27, pp. 869-883, 1976.
14. King J.R., Spachis A.S., "Heuristics for flowshop scheduling," International Journal of Production Research, vol. 18, pp. 343-357, 1980.
15. Rajendran C., "A no-wait flowshop scheduling heuristic to minimize makespan," Journal of the Operational Research Society, vol. 45, pp. 472-478, 1994.
16. Gangadharan R., Rajendran C., "Heuristic algorithms for scheduling in the no-wait flowshop," International Journal of Production Economics, vol. 32, pp. 285-290, 1994.
17. Framinan J.M., Nagano M.S., "Evaluating the performance for makespan minimization in no-wait flowshop sequencing," Journal of Materials Processing Technology, vol. 197, pp. 1-9, 2008.
18. Laha D., Chakraborty U.K., "A constructive heuristic for minimizing makespan in no-wait flow shop scheduling," International Journal of Advanced Manufacturing Technology, vol. 41, pp. 97-109, 2009.
19. Rajendran C., Chaudhuri D., "Heuristic algorithms for continuous flow-shop problem," Naval Research Logistic Quarterly, vol. 37, pp. 695-705, 1990.
20. Bertolissi E., "Heuristic algorithm for scheduling in the no-wait flowshop," Journal of Materials Processing Technology, vol. 107, pp.459-465, 2000.
21. Aldowiasan T., Allahverdi A., "New heuristics for m-machine no-wait flowshop to minimize total completion time," Omega, vol. 32, pp. 345-352, 2004.
22. Framinan J.M., Nagano M.S., Moccellin J.V., "An efficient heuristic for total flowtime minimization in no-wait flowshops," International Journal of Advanced Manufacturing Technology, vol. 46, pp. 1049-1057, 2010.
23. Nawaz M., Enscore E.E. Jr., Ham I., "A heuristic algorithm for the m machine, n job flowshop sequencing problem," Omega, vol. 11, pp. 91-95, 1983.
24. Rajendran C., Ziegler H., "An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs," European Journal of Operational Research, vol. 103, pp. 129-138, 1997.
25. Haupt R., "A survey of priority rule based scheduling," OR Spektrum, vol. 11, pp. 3-16, 1989.
26. Ramasesh R., "Dynamic jobshop scheduling: a survey of simulation research," Omega, vol. 18, pp. 43-57, 1990.
27. Rajendran C., Holthaus O., "A comparative study of dispatching rules in dynamic flowshops and jobshops," European Journal of Operational Research, vol. 115, pp. 156-170, 1999.
28. Kalir A.A., Sarin S.C., "A near-optimal heuristic for the sequencing problem in multiple-batch flow-shops with small equal sublots," Omega, vol. 29, pp. 577-584, 2001.
29. Rajendran C., Alicke K., "Dispatching in flowshops with bottleneck machines," Computers and Industrial Engineering, vol. 52, pp. 89-106, 2007.