A genetic algorithm for solving no-wait flexible flow lines with due window and job rejection

International Journal of Advanced Manufacturing Technology

Volumn 42, Issue 5-6, 2009, Pages 523-532

  Jolai, Fariborz ^a   Sheikh, Shaya ^a   Rabbani, Massoud ^a   Karimi, Behrooz ^b  

^a UNIVERSITY OF TEHRAN   (Iran)

^b AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Genetic algorithm; No wait flexible flow line; Rejection; Time windows

Indexed keywords

COMPUTATIONAL RESULTS; COMPUTATIONAL TIME; DUE WINDOWS; EFFICIENT GENETIC ALGORITHMS; FLEXIBLE FLOW-SHOP PROBLEMS; HEURISTIC MECHANISMS; MIXED INTEGER LINEAR PROGRAMMING MODELS; MULTI STAGES; NO-WAIT FLEXIBLE FLOW LINE; NP-HARD; OPTIMAL SOLUTIONS; QUALITY OF SOLUTIONS; REJECTION; RUNTIMES; SOLUTION PROCEDURES; TIME WINDOWS;

GENETIC ALGORITHMS; INTEGER PROGRAMMING; LINEARIZATION; OPTIMIZATION; WINDOWS;

HEURISTIC ALGORITHMS;

EID: 67349117344     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-008-1618-y     Document Type: Article

References (33)

1. FC Cetinkaya 2006 Unit sized transfer batch scheduling in an automated two-machine flow-line cell with one transport agent Int J Adv Manuf Technol 29 178 183
2. L Wang L Zhang D-Z Zheng 2005 A class of hypothesis-test-based genetic algorithms for flow shop scheduling with stochastic processing time Int J Adv Manuf Technol 25 1157 1163
3. J-S Chen 2006 A branch and bound procedure for the reentrant permutation flow-shop scheduling problem Int J Adv Manuf Technol 29 1186 1193
4. T Aldowaisan A Allahverdi 2004 A New heuristics for m-machine no-wait flowshop to minimize total completion time Omega 32 345 352
5. Candar O (1999) Machine scheduling problems with blocking and no-wait in process. Department of Industrial Engineering, Research Report, Bilkunt University
6. HW Thonton JL Hunsucker 2004 A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage Eur J Oper Res 152 96 114
7. E Bertolissi 2000 Heuristic algorithm for scheduling in the no-wait flow shop J Mater Process Technol 107 459 465
8. R Ruiz A Allahverdi 2007 No-wait flow shop with separate setup times to minimize maximum lateness. Int J Adv Manuf Technol 35 551 565
9. PJ Kalczynski J Kamburowski 2007 On no-wait and no-idle flow shops with makespan criterion Eur J Oper Res 178 677 685
10. Pan Q-K, Tasgetiren M F, Liang Y-C (2008) A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Computers and operations research doi: 10.1016/j.cor.2006.12.030
11. C Low 2005 Simulated annealing heuristic for flow shop scheduling problem with unrelated parallel machines Comput Oper Res 32 2013 2025
12. C Oguz V Zinder VH Do A Janiak M Lichtenstein 2004 Hybrid flow-shop scheduling problem with multi processor task system Eur J Oper Res 152 115 131
13. E Nowicki C Smutnicki 1998 The flow shop with parallel machines: a search approach Eur J Oper Res 106 226 253
14. C Sriskandarajah 1993 Performance of scheduling algorithms for no-wait flow shop with parallel machines Eur J Oper Res 70 365 378
15. S Verma M Dessouky 1999 Multistage hybrid flow shop scheduling with identical jobs and uniform parallel machines J Sched 2 135 150
16. SA Brah JL Hunsucker 1991 Heuristics for scheduling in a flow shop with multiple processors Eur J Oper Res 51 88 99
17. NG Hall C Sriskandarajah 1996 A survey of machine scheduling problems with blocking and no-wait in process Oper Res 44 510 525
18. MS Valente Jorge AFS Alves Rui 2005 An exact approach to early /tardy scheduling with release dates Comput Oper Res 32 2905 2917
19. V Gabrel 1995 Scheduling jobs within time windows on identical parallel machines: new model and algorithms Eur J Oper Res 83 320 329
20. Garcia JMA (2002) Genetic algorithm for solving a production and delivery scheduling problem with time windows. In: Garijo FJ et al (ed) Advances in artificial intelligence. IBERAMIA, Springer-Verlag, Berlin Heidelberg, pp 371-380
21. JM Garcia S Lozano 2005 Production and delivery scheduling problem with time windows Comput Ind Eng 48 733 742
22. V Lauff F Werner 2004 On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties Comput Oper Res 31 317 345
23. D Quadt H Kuhn 2007 A taxonomy of flexible flow line scheduling procedures Eur J Oper Res 178 686 698
24. J Grabowski J Pempera 2005 Some local search algorithms for no-wait flow-shop problem with makespan criterion Comput Oper Res 32 2197 2212
25. Gen M, Chang R (1997) Genetic algorithms and engineering design. Wiley, New York
26. LG Kroon M Salomon LN Van Wassenhove 1995 Exact and approximation algorithms for the operational fixed interval scheduling problems Eur J Oper Res 82 190 205
27. SA Torabi SMT Fatemi Ghomi B Karimi 2006 A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains Eur J Oper Res 173 173 189
28. D-F Shiau SC Cheng YM Huang 2008 Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm, Expert Systems with Applications An Intel J 34 1133 1143
29. H Wang 2005 Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions Exp Syst 22 78 85
30. T Kis E Pesch 2005 A review of exact solution methods for the non-preemptive multiprocessor flowshop problem Eur J Oper Res 164 592 608
31. J Jungwattanakit M Reodecha P Chaovalitwongse F Werner 2007 Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria Int J Adv Manuf Technol 37 354 370
32. MS Jayamohan C Rajendran 2000 A comparative analysis of two different approaches to scheduling in flexible flow shops Prod Plan Control 11 572 580
33. W Kaczmarczyk T Sawik A Schaller TM Tirpak 2004 Optimal versus heuristic scheduling of surface mount technology lines Int J Prod Res 42 2083 2110