No-wait flowshop scheduling problem to minimize the number of tardy jobs

International Journal of Advanced Manufacturing Technology

Volumn 61, Issue 1-4, 2012, Pages 311-323

  Aldowaisan, Tariq A ^a   Allahverdi, Ali ^a  

^a KUWAIT UNIVERSITY   (Kuwait)

Author keywords

Flowshop; Heuristic; No wait; Pair wise exchange; Scheduling; Simulated annealing; Tardy jobs

Indexed keywords

COMPUTATIONAL EXPERIMENT; COMPUTATIONAL TIME; FLOW SHOP SCHEDULING PROBLEM; FLOW-SHOPS; HEURISTIC; NO-WAIT; NP-HARD; NUMBER OF TARDY JOBS; OPTIMAL ALGORITHM; PERCENTAGE ERROR; SIMULATED ANNEALING ALGORITHMS; TARDY JOBS; TWO MACHINES;

SCHEDULING;

SIMULATED ANNEALING;

EID: 84862544353     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-011-3659-x     Document Type: Article

References (37)

1. NG Hall C Sriskandarajah 1996 A survey of machine scheduling problems with blocking and no-wait in process Oper Res 44 510 525 1677545 0864.90060 10.1287/opre.44.3.510 (Pubitemid 126669516)
2. MC Bonney SW Gundry 1976 Solutions to the constrained flowshop sequencing problem Oper Res Q 24 869 883 10.1057/jors.1976.176
3. JR King AS Spachis 1980 Heuristics for flowshop scheduling Int J Prod Res 18 343 357
4. R Gangadharan C Rajendran 1993 Heuristic algorithms for scheduling in the no-wait flowshop Int J Prod Econ 32 285 290 10.1016/0925-5273(93)90042-J
5. T Aldowaisan A Allahverdi 2003 New heuristics for no-wait flowshops to minimize makespan Comput Oper Res 30 1219 1231 1047.90053 10.1016/S0305-0548(02) 00068-0 (Pubitemid 36346004)
6. JM Framinan MS Nagano 2008 Evaluating the performance for makespan minimization in no-wait flowshop sequencing J Mater Process Technol 197 1 9 10.1016/j.jmatprotec.2007.07.039 (Pubitemid 350251172)
7. QK Pan MF Tasgetiren YC Liang 2008 A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem Comput Oper Res 35 2807 2839 2586401 1144.90393 10.1016/j.cor.2006.12.030 (Pubitemid 351193083)
8. OP Singh S Chand 2009 Supply chain design in the electronics industry incorporating JIT purchasing Eur J Ind Eng 3 21 44 10.1504/EJIE.2009.021583
9. RDH Warburton 2009 EOQ extensions exploiting the Lambert W function Eur J Ind Eng 3 45 69 10.1504/EJIE.2009.021584
10. S Sharma 2009 On price increases and temporary price reductions with partial backordering Eur J Ind Eng 3 70 89 10.1504/EJIE.2009.021585
11. I Adiri D Pohoryles 1982 Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times Nav Res Logist Q 29 495 504 703336 0504.90038 10.1002/nav.3800290311
12. C Rajendran D Chaudhuri 1990 Heuristic algorithms for continuous flow-shop problem Nav Res Logist 37 695 705 0707.90052 10.1002/1520-6750(199010) 37:5<695::AID-NAV3220370508>3.0.CO;2-L (Pubitemid 21648558)
13. JAA van der Veen R van Dal 1991 Solvable cases of the no-wait flowshop scheduling problem J Oper Res Soc 42 971 980 0744.90044
14. CL Chen RV Neppalli N Aljaber 1996 Genetic algorithms applied to the continuous flow shop problem Comput Ind Eng 30 919 929 10.1016/0360-8352(96) 00042-3 (Pubitemid 126375903)
15. T Aldowaisan A Allahverdi 2004 A new heuristic for m-machine no-wait flowshop to minimize total completion time OMEGA Int J Manag Sci 32 345 352 10.1016/j.omega.2004.01.004 (Pubitemid 38726375)
16. JL Chang DW Gong XP Ma 2007 A heuristic genetic algorithm for no-wait flowshop scheduling problem J China Univ Min Tech 17 582 586 10.1016/S1006-1266(07)60150-3 (Pubitemid 350286790)
17. A Allahverdi T Aldowaisan 2004 No-wait flowshops with bicriteria of makespan and maximum lateness Eur J Oper Res 152 132 147 2004443 1044.90040 10.1016/S0377-2217(02)00646-X
18. Pinedo M (1995) Scheduling; theory, algorithms, and systems. Prentice Hall, Englewood Cliffs
19. JK Lenstra AHG Kan P Brucker 1977 Complexity of machine scheduling problems Ann Discrete Math 1 343 362 10.1016/S0167-5060(08)70743-X
20. C Koulamas 1998 On the complexity of two-machine flowshop problems with due date related objectives Eur J Oper Res 106 95 100 10.1016/S0377-2217(98) 00323-3 (Pubitemid 128373560)
21. FD Crocea JND Gupta R Tadei 2000 Minimizing tardy jobs in a flowshop with common due date Eur J Oper Res 120 375 381 10.1016/S0377-2217(99)00164-2 (Pubitemid 30542645)
22. R M'Hallah RL Bulfin 2003 Minimizing the weighted number of tardy jobs on a two-machine flow shop Eur J Oper Res 30 1887 1900 2007918 1047.90020 (Pubitemid 36893358)
23. AMA Hariri CN Potts 1989 A branch and bound algorithm to minimize the number of late jobs in a permutation flowshop Eur J Oper Res 38 228 237 983956 0674.90048 10.1016/0377-2217(89)90107-0
24. H-S Choi D-H Lee 2009 Scheduling algorithms to minimize the number of tardy jobs in two-stage hybrid flow shops Comput Ind Eng 56 113 120 2741769 10.1016/j.cie.2008.04.005
25. W-C Lee S-K Chen C-C Wu 2010 Branch-and-bound and simulated annealing algorithms for a two-agent scheduling problem Expert Syst Appl 37 9 6594 6601 10.1016/j.eswa.2010.02.125
26. B Naderi R Tavakkoli-Moghaddam M Khalili 2010 Electromagnetism-like mechanism and simulated annealing algorithms for flowshop scheduling problems minimizing the total weighted tardiness and makespan Knowl-Based Syst 23 77 85 10.1016/j.knosys.2009.06.002
27. S Ulusam Seçkiner M Kurt 2007 A simulated annealing approach to the solution of job rotation scheduling problems Appl Math Comput 188 31 45 1137.90518 10.1016/j.amc.2006.09.082 (Pubitemid 46686699)
28. R Zhang C Wu 2010 A hybrid immune simulated annealing algorithm for the job shop scheduling problem Appl Soft Comput 10 79 89 10.1016/j.asoc.2009.06.008
29. M Nawaz E Enscore I Ham 1983 A heuristic algorithm for the m-machine, n-job flowshop sequencing problem OMEGA The International Journal of Management Sciences 11 91 95 10.1016/0305-0483(83)90088-9 (Pubitemid 13193807)
30. YD Kim 1995 Minimizing total tardiness in permutation flowshops Eur J Oper Res 85 541 555 0912.90174 10.1016/0377-2217(94)00029-C
31. TNS Dath C Rajendran K Narashiman 2010 An empirical study on supply chain management in India: the perspective of original equipment manufacturers and suppliers Eur J Ind Eng 4 2 39 10.1504/EJIE.2010.029568
32. Z Bahroun M Moalla G Baazaoui JP Campagne 2010 Multi-agent modelling for replenishment policies simulation in supply chains Eur J Ind Eng 4 450 470 10.1504/EJIE.2010.035654
33. N Lehoux S D'Amours A Langevin 2010 A win-win collaboration approach for a two-echelon supply chain: a case study in the pulp and paper industry Eur J Ind Eng 4 493 514 10.1504/EJIE.2010.035656
34. JMS Valente JE Schaller 2010 Improved heuristics for the single machine scheduling problem with linear early and quadratic tardy penalties Eur J Ind Eng 4 99 129 10.1504/EJIE.2010.029572
35. HM Soroush 2010 Single-machine scheduling with inserted idle time to minimize a weighted quadratic function of job lateness Eur J Ind Eng 4 131 166 10.1504/EJIE.2010.031075
36. A Manaa C Chu 2010 Scheduling multiprocessor tasks to minimize the makespan on two dedicated processors Eur J Ind Eng 4 265 279 10.1504/EJIE.2010.033331
37. W Besbes J Teghem T Loukil 2010 Scheduling hybrid flow shop problem with non-fixed availability constraints Eur J Ind Eng 4 413 433 10.1504/EJIE.2010. 035652