Hybrid flowshop scheduling with family setup time and inconsistent family formation

International Journal of Production Research

Volumn 50, Issue 6, 2012, Pages 1457-1475

  Luo, Hao ^a   Huang, George Q ^a   Shi, Yuan ^b   Qu, Ting ^a   Zhang, Ying Feng ^a,c  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b SOUTH CHINA UNIVERSITY OF TECHNOLOGY   (China)

^c XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

family setup time; hybrid flowshop scheduling; metaheuristic

Indexed keywords

FLOW SHOP PROBLEMS; HYBRID FLOW SHOP SCHEDULING; MACHINE SETTINGS; MAKESPAN; METAHEURISTIC; PRODUCTION PROCESS; SEQUENCE DEPENDENT SETUPS; SET-UP TIME; STANDARD METAL;

GENETIC ALGORITHMS; SCHEDULING; SCHEDULING ALGORITHMS;

PROBLEM SOLVING;

EID: 84861407526     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2011.560620     Document Type: Article

References (29)

1. Allahverdi, A., et al., 2008. A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187 (3), 985-1032.
2. Anh, T. le, Koster, R. de, and Yu, Y., 2010. Performance evaluation of dynamic scheduling approaches in vehicle-based internal transport systems. International Journal of Production Research, 48 (24), 7219-7242.
3. Behnamian, J., Fatemi Ghomi, S.M.T., and Zandieh, M., 2009. Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times. International Journal of Production Research, 48 (5), 1415-1438.
4. 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.
5. Gen, M. and Cheng, R., 1997. Genetic algorithms and engineering design. New York: Wiley. Glass, C.A., Potts, C.N., and Strusevich, V.A., 2001. Scheduling batches with sequential job processing for two-machine flow and open shops. Informs Journal on Computing, 13 (2), 120-137.
6. Goldgerg, D. and Lingle, R., 1985. Alleles, loci, and the traveling salesman problem. 1st international conference on genetic algorithms and their applications, Hillsdale, NJ, Erlbaum Associates.
7. Gupta, J.N.D. and Chantaravarapan, S., 2008. Single machine group scheduling with family setups to minimise total tardiness. International Journal of Production Research, 46 (6), 1707-1722.
8. Gupta, J.N.D. and Schaller, J.E., 2006. Minimising flow time in a flow-line manufacturing cell with family setup times. The Journal of the Operational Research Society, 57 (2), 163-176.
9. 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.
10. Huang, W. and Li, S., 1998. A two-stage hybrid flowshop with uniform machines and setup times. Mathematical and Computer Modelling, 27 (2), 27-45.
11. Kurz, M.E. and Askin, R.G., 2004. Scheduling flexible flow lines with sequence-dependent setup times. European Journal of Operational Research, 159 (1), 66-82.
12. Lee, G.C. and Kim, Y.D., 2004. A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimising total tardiness. International Journal of Production Research, 42 (22), 4731-4743.
13. Lin, B.M.T. and Cheng, T.C.E., 2005. Two-machine flowshop batching and scheduling. Annals of Operations Research, 133, 149-161.
14. 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.
15. Lin, S.-W., et al., 2009. Using simulated annealing to schedule a flowshop manufacturing cell with sequence-dependent family setup times. International Journal of Production Research, 47 (12), 3205-3217.
16. Luo, H., et al., 2011. Hybrid flowshop scheduling with batch-discrete processors and machine maintenance in time windows. International Journal of Production Research, 49 (6), 1575-1603.
17. Mckay, K., PinedoI, M., and Webster, S., 2002. Practice-focused research issues for scheduling system. Production and Operations Management, 11 (2), 249-258.
18. Michalewicz, Z., 1996. Genetic algorithms+Data structures=Evolution programs. Berlin: Springer-Verlag.
19. Pinedo, M.L., 2008. Scheduling theory, algorithms and systems. Upper Saddle River, New Jersey: Prentice-Hall.
20. Potts, C.N. and Kovalyov, M.Y., 2000. Scheduling with batching: A review. European Journal of Operational Research, 120 (2), 228-249.
21. Ruiz, R. and Maroto, C., 2006. A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. European Journal of Operational Research, 169 (3), 781-800.
22. Sherali, H.D., Sarin, S.C., and Kodialam, M.S., 1990. Models and algorithms for a two-stage production process. Production Planning & Control, 1 (1), 27-39.
23. Wang, X. and Cheng, T.C.E., 2005. Two-machine flowshop scheduling with job class setups to minimise total flowtime. Computers and Operations Research, 32 (11), 2751-2770.
24. Yang, D.-L., Kuo, W.-H., and Chern, M.-S., 2008. Multi-family scheduling in a two-machine reentrant flow shop with setups. European Journal of Operational Research, 187 (3), 1160-1170.
25. Yilmaz, I.O., et al., 2007. Development of group setup strategies for makespan minimisation in PCB assembly. International Journal of Production Research, 45 (4), 871-897.
26. Ying, K.-C., et al., 2010. Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups. International Journal of Production Research, 48 (8), 2169-2184.
27. Yu, Y.G. and de Koster, R.B.M., 2009a. Optimal zone boundaries for two-class-based compact three-dimensional automated storage and retrieval systems. IIE Transactions, 41 (3), 194-208.
28. Yu, Y.G. and de Koster, R.B.M., 2009b. Designing an optimal turnover-based storage rack for a 3D compact automated. International Journal of Production Research, 47 (6), 1551-1571.
29. Zandieh, M., Fatemi Ghomi, S.M.T., and Moattar Husseini, S.M., 2006. An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Applied Mathematics and Computation, 180 (1), 111-127.