Hybrid flowshop scheduling with batch-discrete processors and machine maintenance in time windows

International Journal of Production Research

Volumn 49, Issue 6, 2011, Pages 1575-1603

  Luo, Hao ^a   Huang, George Q ^a   Feng Zhang, Ying ^a,b   Yun Dai, Qing ^c  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b XI'AN JIAOTONG UNIVERSITY   (China)

^c GUANGDONG UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

blocking scheduling; genetic algorithm; multistage flowshop scheduling

Indexed keywords

BLOCKING SCHEDULING; COMPREHENSIVE STUDIES; DISCRETE PROCESSORS; FLOW-SHOP SCHEDULING; HYBRID FLOW SHOP SCHEDULING; INTERMEDIATE BUFFERS; LOADING TIME; MACHINE MAINTENANCE; MAKESPAN; ONE-MACHINE; OPERATIONAL PRINCIPLES; OPTIMAL SCHEDULE; PARALLEL MACHINE; PROCESSING TIME; REAL LIFE DATA; SOLUTION ALGORITHMS; TIME WINDOWS; TWO STAGE;

BUFFER STORAGE; GENETIC ALGORITHMS; INDUSTRY; PROBLEM SOLVING;

SCHEDULING ALGORITHMS;

EID: 78650623486     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207541003610262     Document Type: Article

References (38)

1. Allaoui, H. and Artiba, A., 2006. Scheduling two-stage hybrid flow shop with availability constraints. Computers & Operations Research, 33 (5), 1399-1429.
2. Caraffa, V., et al., 2001. Minimizing makespan in a blocking flowshop using genetic algorithms. International Journal of Production Economics, 70 (2), 101-115.
3. Caricato, P., Grieco, A., and Serino, D., 2007. TSP-based scheduling in a batch-wise hybrid flow-shop. Robotics and Computer-Integrated Manufacturing, 23 (2), 234-241.
4. Chan, K.F. and Hui, C.W., 2003. Scheduling batch production using a stepwise approach. Industrial & Engineering Chemistry Research, 42 (14), 3505-3508.
5. Chen, C.-L., Vempati, V.S., and Aljaber, N., 1995. An application of genetic algorithms for flow shop problems. European Journal of Operational Research, 80 (2), 389-396.
6. Cheng, T.C.E., Gupta, J.N.D., and Wang, G.Q., 2000. A review of flowshop scheduling research with setup times. Production and Operations Management, 9 (3), 262-282.
7. Cochran, J.K., Horng, S.-M., and Fowler, J.W., 2003. A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines. Computers & Operations Research, 30 (7), 1087-1102.
8. Coudert, T., Grabot, B., and Archimede, B., 2002. Production/maintenance cooperative scheduling using multi-agents and fuzzy logic. International Journal of Production Research, 40 (18), 4611-4632.
9. Davis, L., 1991. Handbook of genetic algorithms. New York: Van Nostrand Reinhold.
10. Gen, M. and Cheng, R., 1997. Genetic algorithms and engineering design. New York: Wiley.
11. Goldgerg, D. and Lingle, R., 1985. Alleles, loci, and the traveling salesman problem. In: Proceedings of the first international conference on genetic algorithms and their applications, 24-26 July Pittsburgh, PA, 154-159.
12. Guinet, A., et al., 1996. A computational study of heuristics for two-stage flexible flowshops. International Journal of Production Research, 34 (5), 1399-1415.
13. Gupta, J.N.D., 1988. Two-stage, hybrid flowshop scheduling problem. Journal of the Operational Research Society, 39 (4), 359-364.
14. Gupta, J.N.D. and Tunc, E.A., 1991. Schedules for a two-stage hybrid flowshop with parallel machines at the second stage. International Journal of Production Research, 29 (7), 1489-1502.
15. Gupta, J.N.D. and Stafford, J.E.F., 2006. Flowshop scheduling research after five decades. European Journal of Operational Research, 169 (3), 699-711.
16. Hall, N.G. and Sriskandarajah, C., 1996. A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44 (3), 510-525.
17. Hopp, W.J. and Spearman, M.L., 2000. Factory physics. 2nd ed. Boston, MA: McGraw-Hill International Editions.
18. Huang, G.Q. and Mak, K.L., 2003. Internet applications in product design and manufacturing. Berlin: Springer.
19. Huang, G.Q., Zhang, Y.F., and Jiang, P.Y., 2007. RFID-based wireless manufacturing for walkingworker assembly islands with fixed-position layouts. Robotics and Computer-Integrated Manufacturing, 23 (4), 469-477.
20. Huang, G.Q., et al., 2008. RFID-enabled real-time wireless manufacturing for adaptive assembly planning and control. Journal of Intelligent Manufacturing, 19 (6), 701-713.
21. Iyer, S.K. and Saxena, B., 2004. Improved genetic algorithm for the permutation flowshop scheduling problem. Computers & Operations Research, 31 (4), 593-606.
22. Jain, A.K., Murty, M.N., and Flynn, P.J., 1999. Data clustering: a review. ACM Computing Surveys, 31 (3), 264-323.
23. Kim, B. and Kim, S., 2002. Application of genetic algorithms for scheduling batch-discrete production system. Production Planning & Control, 13 (2), 155-165.
24. Lee, C.Y., Uzsoy, R., and Martin-Vega, L.A., 1992. Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research, 40 (4), 764-775.
25. Lee, Y.H. and Pinedo, M., 1997. Scheduling jobs on parallel machines with sequence-dependent setup times. European Journal of Operational Research, 100 (3), 464-474.
26. Lin, H.-T. and Liao, C.-J., 2003. A case study in a two-stage hybrid flow shop with setup time and dedicated machines. International Journal of Production Economics, 86 (2), 133-143.
27. Linn, R. and Zhang, W., 1999. Hybrid flow shop scheduling: a survey. Computers & Industrial Engineering, 37 (1-2), 57-61.
28. Michalewicz, Z., 1996. Genetic algorithms+data structures=evolution programs. Berlin: Springer-Verlag.
29. O'Donovan, R., Uzsoy, R., and McKay, K.N., 1999. Predictable scheduling of a single machine with breakdowns and sensitive jobs. International Journal of Production Research, 37 (18), 4217-4233. (Pubitemid 30519011)
30. Oguz, C. and Ercan, M.F., 2005. A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks. Journal of Scheduling, 8 (4), 323-351.
31. Potts, C.N. and Kovalyov, M.Y., 2000. Scheduling with batching: a review. European Journal of Operational Research, 120 (2), 228-249.
32. Riane, F., Artiba, A., and Elmaghraby, S.E., 1998. A hybrid three-stage flowshop problem: efficient heuristics to minimize makespan. European Journal of Operational Research, 109 (2), 321-329.
33. Schmidt, G., 2000. Scheduling with limited machine availability. European Journal of Operational Research, 121 (1), 1-15.
34. Tang, L.X. and Huang, L., 2007. Optimal and near-optimal algorithms to rolling batch scheduling for seamless steel tube production. International Journal of Production Economics, 105 (2), 357-371.
35. Wong, W.K., Chan, C.K., and Ip, W.H., 2001. A hybrid flowshop scheduling model for apparel manufacture. International Journal of Clothing Science and Technology, 13 (2), 115-131.
36. Wu, L.Y., et al., 2005. A genetic algorithm-based approach to scheduling of batch production with maximum profit. Chinese Journal of Chemical Engineering, 13 (1), 68-73.
37. Xuan, H. and Tang, L., 2007. Scheduling a hybrid flowshop with batch production at the last stage. Computers & Operations Research, 34 (9), 2718-2733.
38. Zhang, Y.F., Jiang, P.Y., and Zhou, G.H., 2003. GA-driven part e-manufacturing scheduling via an online e-service platform. International Journal of Integrated Manufacturing Systems, 14 (7), 575-585.