Active scheduling for hybrid flowshop with family setup time and inconsistent family formation

Journal of Intelligent Manufacturing

Volumn 26, Issue 1, 2015, Pages 169-187

  Luo, Hao ^a   Zhang, Abraham ^b   Huang, George Q ^a  

^a DEPARTMENT OF INDUSTRIAL AND MANUFACTURING SYSTEMS ENGINEERING   (China)

^b UNIVERSITY OF WAIKATO   (New Zealand)

Author keywords

Active schedule; Family setup time; Hybrid flowshop scheduling; Inconsistent family formation; Non delay schedule

Indexed keywords

FACTOR ANALYSIS; MACHINE SHOPS; SCHEDULING;

ACTIVE SCHEDULES; COMPUTATIONAL EXPERIMENT; EFFECTIVENESS AND EFFICIENCIES; FAMILY SETUP TIME; HYBRID FLOW SHOP SCHEDULING; INCONSISTENT FAMILY FORMATION; MACHINE SETTINGS; PRODUCTION PROCESS;

JOB SHOP SCHEDULING;

EID: 84921068224     PISSN: 09565515     EISSN: 15728145     Source Type: Journal    
DOI: 10.1007/s10845-013-0771-9     Document Type: Article

References (16)

1. Allahverdi, A., Ng, C. T., Cheng, T. C. E., & Kovalyov, M. Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187(3), 985–1032.
2. Gen, M., & Cheng, R. (1997). Genetic algorithms and engineering design. New York: Wiley.
3. Goldgerg, D., & Lingle, R. (1985). Alleles, loci, and the traveling salesman problem. Hillsdale: Paper presented at the First international Conference on Genetic Algorithms and their Applications.
4. Gupta, J. N. D., & Schaller, J. E. (2005). Minimizing flow time in a flow-line manufacturing cell with family setup times. Journal of the Operational Research Society, 57(2), 163–176.
5. Kim, H.-W., & Lee, D.-H. (2009). Heuristic algorithms for re-entrant hybrid flow shop scheduling with unrelated parallel machines. Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 223(4), 433–442.
6. Lin, B. M. T., & Cheng, T. C. E. (2005). Two-machine flowshop batching and scheduling. Annals of Operations Research, 133, 149–161.
7. Logendran, R., Carson, S., & Hanson, E. (2005). Group scheduling in flexible flow shops. International Journal of Production Economics, 96(2), 143–155.
8. Logendran, R., deSzoeke, P., & Barnard, F. (2006). Sequence-dependent group scheduling problems in flexible flow shops. International Journal of Production Economics, 102(1), 66–86.
9. Luo, H., Huang, G. Q., Shi, Y., Qu, T., & Zhang, Y. (2012). Hybrid flowshop scheduling with family setup time and inconsistent family formation. International Journal of Production Research, 50(6), 1457–1475.
10. Mendes, J. J. M., Gonçalves, J. F., & Resende, M. G. C. (2009). A random key based genetic algorithm for the resource constrained project scheduling problem. Computers & Operations Research, 36(1), 92–109.
11. Michalewicz, Z. (1996). Genetic algorithms+data structures=evolution programs. Berlin: Springer.
12. Mirsanei, H., Zandieh, M., Moayed, M., & Khabbazi, M. (2011). A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times. Journal of Intelligent Manufacturing, 22(6), 965–978.
13. Pinedo, M. L. (2008). Scheduling: Theory, algorithms, and systems (3rd ed.). Berlin: Springer.
14. Salmasi, N., Logendran, R., & Skandari, M. (2011). Makespan minimization of a flowshop sequence-dependent group scheduling problem. The International Journal of Advanced Manufacturing Technology, 56(5), 699–710.
15. Sprecher, A., Kolisch, R., & Drexl, A. (1995). Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem. European Journal of Operational Research, 80(1), 94–102.
16. Zandieh, M., Mozaffari, E., & Gholami, M. (2010). A robust genetic algorithm for scheduling realistic hybrid flexible flow line problems. Journal of Intelligent Manufacturing, 21(6), 731–743.