Due windows group scheduling using an effective hybrid optimization approach

International Journal of Advanced Manufacturing Technology

Volumn 46, Issue 5-8, 2010, Pages 721-735

  Behnamian, J ^a   Zandieh, M ^b   Fatemi Ghomi, S M T ^a  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

^b SHAHID BEHESHTI UNIVERSITY   (Iran)

Author keywords

Due window scheduling; Group scheduling; Hybrid flow shops; Hybrid metaheuristic; Particle swarm optimization; Simulated annealing; Variable neighborhood

Indexed keywords

DUE-WINDOW; HYBRID FLOW SHOP; HYBRID FLOW SHOPS; HYBRID METAHEURISTIC; METAHEURISTIC;

ALGORITHMS; ANNEALING; COMPUTATION THEORY; COMPUTATIONAL EFFICIENCY; DESIGN OF EXPERIMENTS; FLEXIBLE MANUFACTURING SYSTEMS; HEURISTIC METHODS; MACHINE SHOP PRACTICE; MATHEMATICAL OPERATORS; PARTICLE SWARM OPTIMIZATION (PSO); WINDOWS;

SIMULATED ANNEALING;

EID: 74249095878     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-009-2147-z     Document Type: Article

References (62)

1. A Allahverdi CT Ng TCE Cheng MY Kovalyov 2008 A survey of scheduling problems with setup times or costs Eur J Oper Res 187 985 1032 10.1016/j.ejor.2006.06.060 1137.90474 10.1016/j.ejor.2006.06.060 2378326 (Pubitemid 350236619)
2. Allison JD (1990) Combining Petrov's heuristic and the CDS heuristic in group scheduling problems. Proceedings of the 12th Annual Conference on Computers and Industrial Engineering, Orlando, FL, pp 457-461
3. C Andres JM Albarracin G Tormo E Vicens JP Garcia-Sabater 2005 Group technology in a hybrid flowshop environment: a case study Eur J Oper Res 167 272 281 10.1016/j.ejor.2004.03.026 1074.90524 10.1016/j.ejor.2004.03.026 2148704 (Pubitemid 40220015)
4. Anger FD, Lee CY, Martin-Vega LA (1986) Single-machine scheduling with tight windows. Research Paper, 86-16, University of Florida
5. KR Baker 1988 Scheduling the production of components at a common facility IIE Trans 20 32 35 10.1080/07408178808966147 10.1080/07408178808966147
6. KR Baker 1990 Scheduling groups of jobs in the two-machine flowshop Math Comput Model 13 29 36 10.1016/0895-7177(90)90368-W 10.1016/0895-7177(90)90368-W (Pubitemid 20693488)
7. J Behnamian M Zandieh MTF Ghomi 2009 Due window scheduling with sequence-dependent setup on parallel machines using three hybrid metaheuristic algorithms Int J Adv Manuf Technol. 10.1007/s00170-008-1885-7
8. HG Campbell RA Dudek ML Smith 1970 A heuristic algorithm for the n job, m machine sequencing problem Manage Sci 16 630 637 10.1287/mnsc.16.10.B630 10.1287/mnsc.16.10.B630
9. FC Cetinkaya MS Kayaligil 1992 Unit sized transfer batch scheduling with setup times Comput Ind Eng 22 177 183 10.1016/0360-8352(92)90045-L 10.1016/0360-8352(92)90045-L
10. ZL Chen CY Lee 2002 Parallel machines scheduling with a common due window Eur J Oper Res 136 512 527 10.1016/S0377-2217(01)00068-6 1007.90024 10.1016/S0377-2217(01)00068-6 1869006 (Pubitemid 33094118)
11. TCE Cheng 1988 Optimal common due-date with limited completion time deviation Comput Oper Res 15 91 96 10.1016/0305-0548(88)90001-9 0635.90050 10.1016/0305-0548(88)90001-9 (Pubitemid 18594015)
12. D Danneberg T Tautenhahn F Werner 1999 A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size Math Comput Model 29 9 101 126 10.1016/S0895-7177(99)00085-0 0987.90032 10.1016/S0895-7177(99)00085-0 1698401 (Pubitemid 29291829)
13. SR Das C Canel 2005 An algorithm for scheduling batches of parts in a multi-cell flexible manufacturing system Int J Prod Econ 97 247 262 10.1016/j.ijpe.2004.07.006 10.1016/j.ijpe.2004.07.006 (Pubitemid 40788672)
14. AE Eiben R Hinterding Z Michalewicz 1999 Parameter control in evolutionary algorithms IEEE Trans Evol Comput 3 22 124 141 10.1109/4235.771166 10.1109/4235.771166
15. D-H Eom H-J Shin I-H Kwun J-K Shim S-S Kim 2002 Scheduling jobs on parallel machines with sequence-dependent family setup times Int J Adv Manuf Technol 19 926 932 10.1007/s001700200105 10.1007/s001700200105 (Pubitemid 34777325)
16. PM Franca JND Gupta AS Mendesd P Moscatod KJ Veltink 2005 Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups Comput Ind Eng 48 491 506 10.1016/j.cie.2003.11.004 10.1016/j.cie.2003.11.004 (Pubitemid 40308644)
17. Gupta JND, Gupta SK (1988) Single facility scheduling with nonlinear processing times. Comput Ind Eng 14:387-393
18. JND Gupta JE Schaller 2006 Minimizing flow time in a flow-line manufacturing cell with family setup times J Oper Res Soc 57 163 176 1090.90082
19. Ham I, Hitomi K, Yoshida T (1985) Group technology: applications to production management. Kluwer Academic, Hingham
20. P Hansen N Mladenovic U Dragan 2004 Variable neighborhood search for the maximum clique Discrete Appl Math 145 1 117 125 10.1016/j.dam.2003.09.012 1058.90053 10.1016/j.dam.2003.09.012 2108437
21. SH Hendizadeh H Faramarzi SA Mansouri JND Gupta TY ElMekkawy 2008 Meta-heuristics for scheduling a flowline manufacturing cell with sequence dependent family setup times Int J Prod Econ 111 593 605 10.1016/j.ijpe.2007.02. 031 10.1016/j.ijpe.2007.02.031 (Pubitemid 350299155)
22. Heragu S (1997) Facilities design. PWS, Boston
23. A Janiak MY Kovalyov MC Portmann 2005 Single machine group scheduling with resource dependent setup and processing times Eur J Oper Res 162 112 121 10.1016/j.ejor.2002.11.004 1132.90325 10.1016/j.ejor.2002.11.004 2101260
24. A Janiak E Kozan M Lichtenstein C Oguz 2007 Metaheuristic approaches to the hybrid flowshop scheduling problem with a cost-related criterion Int J Prod Econ 105 407 424 10.1016/j.ijpe.2004.05.027 10.1016/j.ijpe.2004.05.027 (Pubitemid 44827610)
25. Kennedy J, Eberhart R (1995) Particle swarm optimization. Proceeding of the 1995 IEEE international conference on neural network, Perth, Australia, pp 1942-1948
26. S Kirkpatrick CD Gelatt MP Vecchi 1983 Optimization by simulated annealing Science 220 671 680 10.1126/science.220.4598.671 10.1126/science.220. 4598.671 702485
27. FJ Kramer CY Lee 1994 Due window scheduling for parallel machines Math Comput Model 20 69 89 10.1016/0895-7177(94)90208-9 10.1016/0895-7177(94)90208-9 1290003
28. W Kuo D Yang 2006 Single-machine group scheduling with a time-dependent learning effect Comput Oper Res 33 2099 2112 10.1016/j.cor.2004.11.024 1086.90025 10.1016/j.cor.2004.11.024
29. BY Leu JW Nazemetz 1995 Comparative analysis of group scheduling heuristics in a flowshop cellular system Int J Oper Prod Manage 15 9 143 157 10.1108/01443579510099715 10.1108/01443579510099715 (Pubitemid 39032458)
30. MM Liaee H Emmons 1997 Scheduling families of jobs with setup times Int J Prod Econ 51 165 176 10.1016/S0925-5273(96)00105-3 10.1016/S0925-5273(96)00105- 3
31. R Linn W Zhang 1999 Hybrid flow shop scheduling: a survey Comput Ind Eng 37 57 61 10.1016/S0360-8352(99)00023-6 10.1016/S0360-8352(99)00023-6
32. Z Liu W Yu 1999 Minimizing the number of late jobs under the group technology assumption J Comb Optim 3 5 15 10.1023/A:1009841719644 0967.90048 10.1023/A:1009841719644 1702477
33. R Logendran N Nudtasomboon 1991 Minimizing the makespan of a group scheduling problem: a new heuristic Int J Prod Econ 22 217 230 10.1016/0925-5273(91)90098-E 10.1016/0925-5273(91)90098-E
34. R Logendran L Mai D Talkington 1995 Combined heuristics for bi-level group scheduling problems Int J Prod Econ 38 133 145 10.1016/0925-5273(94)00083- M 10.1016/0925-5273(94)00083-M
35. R Logendran S Carson E Hanson 2005 Group scheduling in flexible flowshops Int J Prod Econ 96 2 143 155 10.1016/j.ijpe.2004.03.011 10.1016/j.ijpe.2004.03. 011 (Pubitemid 40200696)
36. R Logendran P de Szoeke F Barnard 2006 Sequence-dependent group scheduling problems in flexible flowshops Int J Prod Econ 102 66 86 10.1016/j.ijpe.2005.02.006 10.1016/j.ijpe.2005.02.006 (Pubitemid 43374568)
37. F Mahmoodi KJ Dooley 1991 A comparison of exhaustive and non-exhaustive group scheduling heuristics in a manufacturing cell Int J Prod Res 29 9 1923 1939 10.1080/00207549108948058 0729.90531 10.1080/00207549108948058
38. R Mansini M Grazia Speranza Z Tuza 2004 Scheduling groups of tasks with precedence constraints on three dedicated processors Discrete Appl Math 134 141 168 10.1016/S0166-218X(03)00302-0 1074.68007 10.1016/S0166-218X(03)00302-0 2019496
39. Mitrofanov SP (1966) Scientific principles of group technology. National Lending Library, London, Boston Spa English translation
40. Petrov VA (1966) Flow line group production planning. Business Publications, London
41. SG Ponnambalam P Aravindan KRR Reddy 1999 Analysis of group-scheduling heuristics in a manufacturing cell Int J Adv Manuf Technol 15 914 932 10.1007/s001700050149 (Pubitemid 30531743)
42. C Rajendran H Ziegler 1999 Heuristics for scheduling in flowshops and flowline-based manufacturing cells to minimize the sum of weighted flow time and weighted tardiness of jobs Comput Ind Eng 37 671 690 10.1016/S0360-8352(00) 00003-6 (Pubitemid 30850799)
43. V Reddy TT Narendran 2003 Heuristics for scheduling sequence dependent set-up jobs in flow line cells Int J Prod Res 41 1 193 206 1064.90533 10.1080/00207540210163973
44. J Schaller 2001 A new lower bound for the flowshop group scheduling problem Comput Ind Eng 41 151 161 10.1016/S0360-8352(01)00049-3 (Pubitemid 32935093)
45. J Schaller 2007 Scheduling on a single machine with family setups to minimize total tardiness Int J Prod Econ 105 329 344 10.1016/j.ijpe.2004.10.020 (Pubitemid 44827602)
46. JE Schaller JND Gupta AJ Vakharia 2000 Scheduling a flowline manufacturing cell with sequence dependent family setup times Eur J Operat Res 125 324 339 0965.90023 10.1016/S0377-2217(99)00387-2 (Pubitemid 30890458)
47. J Skorin-Kapov AJ Vakharia 1993 Scheduling a flow-line manufacturing cell: a tabu search approach Int J Prod Res 31 7 1721 1733 10.1080/ 00207549308956819
48. M Solimanpur P Vrat R Shankar 2004 A heuristic to minimize makespan of cell scheduling problem Int J Prod Econ 88 231 241 10.1016/S0925-5273(03)00196-8
49. J Sridhar C Rajendran 1993 Scheduling in a cellular manufacturing system: a simulated annealing approach Int J Prod Res 31 12 2927 2945 10.1080/00207549308956908
50. AJ Vakharia YL Chang 1990 A simulated annealing approach to scheduling a manufacturing cell Nav Res Logist 37 559 577 0701.90049 10.1002/1520- 6750(199008)37:4<559::AID-NAV3220370409>3.0.CO;2-8 1066197
51. RG Vickson BE Alfredsson 1992 Two- and three-machine flowshop scheduling problems with equal sized transfer batches Int J Prod Res 30 1551 1574 0825.90542 10.1080/00207549208948107
52. A Vignier JC Billaut C Proust 1999 Les problemes dordonnancement de type flow shop hybride: Etat de lart RAIRO Operations Research 33 117 183 0960.90042 10.1051/ro:1999108 1716954 (Pubitemid 32082126)
53. AD Wilson RE King TJ Hodgson 2004 Scheduling non-similar groups on a flow line: multiple group setups Robot Comput Integr Manuf 20 505 515 10.1016/j.rcim.2004.07.002
54. DL Yang MS Chern 2000 Two-machine flowshop group scheduling problem Comput Operat Res 27 975 985 0970.90037 10.1016/S0305-0548(99)00070-2 1762925 (Pubitemid 30334513)
55. W Yang C Liao 1999 Survey of scheduling research involving setup times Int J Syst Sci 30 2 143 155 0995.90037 10.1080/002077299292498 1697866
56. X Yao 1995 A new simulated annealing algorithm Int J Comput Math 56 161 168 0852.68040 10.1080/00207169508804397
57. WK Yeung C Oguz TCE Cheng 2001 Single machine scheduling with a common due window Comput Operat Res 28 157 175 0990.90050 10.1016/S0305-0548(99)00097-0 1790017
58. WK Yeung C Oguz TCE Cheng 2001 Minimizing weighed number of early and tardy jobs with a common due window involving location penalty Ann Operat Res 108 33 54 0993.90044 10.1023/A:1016094508744 1923063 (Pubitemid 33640260)
59. WK Yeung C Oguz TCE Cheng 2004 Two-stage flowshop earliness and tardiness machine scheduling involving a common due window Int J Prod Econ 90 421 434 10.1016/S0925-5273(03)00044-6
60. Yeung WK, Oguz C, Cheng TCE (2009) Two-machine flow shop scheduling with due windows to minimize weighted number of early and tardy jobs. Nav Res Logist (in press)
61. M Zandieh SMT Fatemi Ghomi SM Moattar Husseini 2006 An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times Appl Math Comput 180 111 127 1102.90029 10.1016/j.amc.2005.11.136 2263370 (Pubitemid 44331328)
62. M Zandieh B Dori AR Khamseh 2009 Robust metaheuristics for group scheduling with sequence-dependent setup times in hybrid flexible flowshops Int J Adv Manuf Technol 10.1007/s00170-008-1740-x