A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop

Computers and Operations Research

Volumn 39, Issue 7, 2012, Pages 1305-1314

  El Bouri, Ahmed ^a  

^a SULTAN QABOOS UNIVERSITY   (Oman)

Author keywords

Dispatching rules; Flowshop; Heuristics; Mean tardiness; Scheduling

Indexed keywords

COMPARATIVE ANALYSIS; COMPUTATIONAL RESULTS; DECISION PROCEDURE; DISPATCHING RULES; FLOW-SHOPS; HEURISTICS; JOB-DISPATCHING; MEAN TARDINESS; MULTIPLE REGRESSION MODEL; ON CURRENTS; PERFORMANCE CRITERION; PRODUCTION CYCLE; RANDOM POINTS; REAL TIME SCHEDULING; TEST PROBLEM;

REGRESSION ANALYSIS;

SCHEDULING;

EID: 81555208220     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.07.004     Document Type: Article

References (30)

1. A.H.G. Rinnooy Kan Machine scheduling problems: classification, complexity and computations 1976 Martinus Nijhoff The Hague
2. J. Du, and J.Y.T. Leung Minimizing total tardiness on one machine is NP-hard Mathematics of Operations Research 15 3 1990 483 495
3. T. Sen, and P. Dileepan Gupta JND. The two-machine flowshop scheduling problem with total tardiness Computers and Operations Research 16 1989 333 340 (Pubitemid 20655909)
4. Y.-D. Kim A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops Computers and Operations Research 20 4 1993 391 401
5. J.C.H. Pan, J.S. Chen, and C.M. Chao Minimizing tardiness in a two-machine flow-shop Computers and Operations Research 29 2002 869 885
6. Y.-D. Kim Heuristics for flowshop problems minimizing mean tardiness The Journal of the Operational Research Society 44 1 1993 19 28
7. N. Raman Minimum tardiness scheduling in flow shops: construction and evaluation of alternative solution approaches Journal of Operations Management 85 1995 131 151
8. E. Vallada, R. Ruiz, and G. Minella Minimising total tardiness in the m-machine flowshop problem: a review and evaluation of heuristics and metaheuristics Computers and Operations Research 35 4 2008 1350 1373 (Pubitemid 47404775)
9. D. Ouelhadj, and S. Petrovic A survey of dynamic scheduling in manufacturing systems Journal of Scheduling 12 4 2009 417 431
10. S.S. Panwalkar, and W. Iskander A survey of scheduling rules Operations Research 25 1 1977 45 61
11. J.H. Blackstone, D.T. Phillips, and G.L. Hogg A state-of-the-art survey of dispatching rules for manufacturing job shop operations International Journal of Production Research 20 1 1982 27 45
12. R. Haupt A survey of priority rule-based scheduling OR Spektrum 11 1 1989 3 16
13. A. Jain, P.K. Jain, and I.P. Singh An investigation on the performance of dispatching rules in FMS scheduling International Journal of Simulation Modelling 3 2-3 2004 49 60
14. R.T. Barrett, and S.A. Barman SLAM II simulation study of a simplified flow shop Simulation 47 1986 181 189
15. R. Barrett, and S. Kadipasaoglu Dispatching rules for a dynamic flow shop Production and Inventory Management Journal First Quarter 1990 54 58 (Pubitemid 20684818)
16. J.L. Hunsucker, and J.R. Shah Performance of priority rules in a due date flow shop OMEGA 20 1 1992 73 89
17. J.L. Hunsucker, and J.R. Shah Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment European Journal of Operational Research 72 1 1994 102 114
18. H. Sarper, and M.C. Henry Combinatorial evaluation of six dispatching rules in a dynamic two-machine flow shop Omega 24 1 1996 73 81 (Pubitemid 126159534)
19. C. Rajendran, and O. Holthaus A comparative study of dispatching rules in dynamic flowshops and jobshops European Journal of Operational Research 116 1 1999 156 170
20. C. Rajendran, and K. Alicke Dispatching in flowshops with bottleneck machines Computers and Industrial Engineering 52 1 2007 89 106 (Pubitemid 46135846)
21. R. Swaminathan, M.E. Pfund, J.W. Fowler, S.J. Mason, and A. Keha Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times Computers and Operations Research 34 10 2007 3055 3068 (Pubitemid 46356736)
22. E. Lodree Jr., W. Jang, and C.M. Klein A new rule for minimizing the number of tardy jobs in dynamic flow shops European Journal of Operational Research 159 1 2004 258 263
23. W. Mouelhi-Chibani, and H. Pierreval Training a neural network to select dispatching rules in real time Computers and Industrial Engineering 58 2 2010 249 256
24. A. El-Bouri, N. Popplewell, and S. Balakrishnan Cooperative dispatching for minimizing mean flowtime in a dynamic flowshop International Journal of Production Economics 113 2 2008 819 833
25. T.D. Fry, L. Vickens, K. MaCleod, and S. Fernandez A heuristic solution procedure to minimize T on a single machine Journal of the Operational Research Society 40 1989 293 297
26. K.R. Baker, and J.W.M. Bertrand A comparison of due-date selection rules AIIE Transactions 13 2 1981 123 131
27. Conte SD, Dunsomore HE, Shen YE. Software engineering metrics and models. Benjamin/Cummings Series in Software Engineering. Menlo Park; 1986.
28. T.E. Morton, and D.W. Pentico Heuristic scheduling systems with applications to production systems and project management 1993 Wiley New York
29. A.M. Law, and W.D. Kelton Confidence intervals for steady-state simulations: I. A survey of fixed sample size procedures Operations Research 32 6 1984 1221 1239 (Pubitemid 15457476)
30. Y. Hochberg, and A.C. Tamhane Multiple comparison procedures 1987 John Wiley and Sons, Inc