A comparison of priority rules for the job shop scheduling problem under different flow time- and tardiness-related objective functions

References

• Adams , J , Balas , E and Zawack , D . 1988 . The shifting bottleneck procedure for job shop scheduling . Management Science , 34 ( 3 ) : 391 – 401 .
   Web of Science ®Google Scholar
• Anderson , E and Nyirenda , J . 1990 . Two new rules to minimize tardiness in a job shop . International Journal of Production Research , 28 ( 12 ) : 2277 – 2292 .
   Web of Science ®Google Scholar
• Applegate , D and Cook , W . 1991 . A computational study of the job-shop scheduling problem . ORSA Jounal on Computing , 3 ( 2 ) : 149 – 156 .
   Google Scholar
• Artigues , C , Lopez , P and Ayache , P . 2005 . Schedule generation schemes for the job-shop problem with sequence-dependent setup times: Dominance properties and computational analysis . Annals of Operations Research , 138 ( 1 ) : 21 – 52 .
   Web of Science ®Google Scholar
• Baker , K and Bertrand , J . 1981 . An investigation of due-date assignment rules with constrained tightness . Journal of Operations Management , 1 ( 3 ) : 109 – 120 .
   Google Scholar
• Barman , S . 1997 . Simple priority rule combinations: An approach to improve both flow time and tardiness . International Journal of Production Research , 35 ( 10 ) : 2857 – 2870 .
   Web of Science ®Google Scholar
• Blackstone , J Jr , Phillips , D and Hogg , G . 1982 . A state-of-the-art survey of dispatching rules for manufacturing job shop operations . International Journal of Production Research , 20 ( 1 ) : 27 – 45 .
   Web of Science ®Google Scholar
• Brandimarte , P . 1993 . Routing and scheduling in a flexible job shop by tabu search . Annals of Operations Research , 41 ( 1 ) : 157 – 183 .
   Google Scholar
• Carlier , J . 1978 . Ordonnancements a contraintes disjonctives . Operations Research , 12 ( 4 ) : 331 – 351 .
   Web of Science ®Google Scholar
• Chen , H and Luh , P . 2003 . An alternative framework to Lagrangian relaxation approach for job shop scheduling . European Journal of Operational Research , 149 ( 3 ) : 499 – 512 .
   Web of Science ®Google Scholar
• Cheung , W and Zhou , H . 2001 . Using genetic algorithms and heuristics for job shop scheduling with sequence-dependent setup times . Annals of Operations Research , 107 ( 1 ) : 65 – 81 .
   Web of Science ®Google Scholar
• Chiang , T and Fu , L . 2007 . Using dispatching rules for job shop scheduling with due-date based objectives . International Journal of Production Research , 45 ( 14 ) : 3245 – 3262 .
   Web of Science ®Google Scholar
• Chiang , T and Fu , L . 2008 . A rule-centric memetic algorithm to minimize the number of tardy jobs in the job shop . International Journal of Production Research , 46 ( 24 ) : 6913 – 6931 .
   Web of Science ®Google Scholar
• Dauzère-Pérès , S and Paulli , J . 1997 . An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search . Annals of Operations Research , 70 : 281 – 306 .
   Web of Science ®Google Scholar
• Dominic , P , Kaliyamoorthy , S and Saravana Kumar , M . 2004 . Efficient dispatching rules for dynamic job shop scheduling . International Journal of Advanced Manufacturing Technology , 24 ( 1 ) : 70 – 75 .
   Web of Science ®Google Scholar
• Fisher , H and Thompson , G . 1963 . “ Probabilistic learning combinations of local job-shop scheduling rules ” . In Industrial scheduling. , 225 – 251 . Engelwood Cliffs , NJ : Prentice-Hall .
   Google Scholar
• Garey , MR , Johnson , DS and Seth , R . 1976 . The complexity of flowshop and jobshop scheduling . Mathematics of Operations Research , 1 ( 2 ) : 117 – 129 .
   Google Scholar
• Graham , R . 1979 . Optimization and approximation in deterministic sequencing and scheduling: A survey . Annals of Discrete Mathematics , 5 : 287 – 326 .
   Google Scholar
• Ho , N and Tay , J . 2005 . Evolving dispatching rules for solving the flexible job-shop problem . In: Proceedings of the IEEE congress on evolutionary computing, CEC , : 2848 – 2855 .
   Google Scholar
• Holthaus , O and Rajendran , C . 1997 . Efficient dispatching rules for scheduling in a job shop . International Journal of Production Economics , 48 ( 1 ) : 87 – 105 .
   Web of Science ®Google Scholar
• Holthaus , O and Rajendran , C . 2000 . Efficient jobshop dispatching rules: Further developments . Production Planning & Control , 11 ( 2 ) : 171 – 178 .
   Web of Science ®Google Scholar
• Hurink , J , Jurisch , B and Thole , M . 1994 . Tabu search for the job-shop scheduling problem with multi-purpose machines . OR Spektrum , 15 ( 4 ) : 205 – 215 .
   Google Scholar
• Jain , A and Meeran , S . 1999 . Deterministic job-shop scheduling: Past, present and future . European Journal of Operational Research , 113 ( 2 ) : 390 – 434 .
   Web of Science ®Google Scholar
• Jayamohan , M and Rajendran , C . 2000 . New dispatching rules for shop scheduling: A step forward/backward . International Journal of Production Research , 38 ( 3 ) : 563 – 586 .
   Web of Science ®Google Scholar
• Jayamohan , M and Rajendran , C . 2004 . Development and analysis of cost-based dispatching rules for job shop scheduling . European Journal of Operational Research , 157 ( 2 ) : 307 – 321 .
   Web of Science ®Google Scholar
• Jensen , JB , Philipoom , PR and Malhotra , MK . 1995 . Evaluation of scheduling rules with commensurate customer priorities in job shops . Journal of Operations Management , 13 ( 3 ) : 213 – 228 .
   Google Scholar
• Kim , Y-D . 1990 . A comparison of dispatching rules for job shops with multiple identical jobs and alternative routeings . International Journal of Production Research , 28 ( 5 ) : 953 – 962 .
   Web of Science ®Google Scholar
• Lawrence , S . 1984 . “ Resource constrained project scheduling: An experimental investigation of heuristic scheduling techniques ” . In Graduate School of Industrial Administration , Pittsburgh , PA : Carnegie-Mellon University .
   Google Scholar
• Muhlemann , A , Lockett , A and Farn , C-K . 1982 . Job shop scheduling heuristics and frequency of scheduling . International Journal of Production Research , 20 ( 2 ) : 227 – 241 .
   Web of Science ®Google Scholar
• Pinedo , M . 2002 . Scheduling – Theory, algorithms, and systems , 2nd , Upper Saddle River , NJ : Prentice-Hall .
   Google Scholar
• Rajendran , C and Holthaus , O . 1999 . A comparative study of dispatching rules in dynamic flowshops and jobshops . European Journal of Operational Research , 116 ( 1 ) : 156 – 170 .
   Web of Science ®Google Scholar
• Russell , R , Dar-El , E and Taylor , B . 1987 . A comparative analysis of the covert job sequencing rule using various shop performance measures . International Journal of Production Research , 25 ( 10 ) : 1523 – 1540 .
   Web of Science ®Google Scholar
• Storer , R , Wu , S and Vaccari , R . 1992 . New search spaces for sequencing problems with application to job shop scheduling . Management Science , 38 ( 10 ) : 1495 – 1509 .
   Web of Science ®Google Scholar
• Subramaniam , V . 2000a . Dynamic selection of dispatching rules for job shop scheduling . Production Planning & Control , 11 ( 1 ) : 73 – 81 .
   Web of Science ®Google Scholar
• Subramaniam , V . 2000b . Machine selection rules in a dynamic job shop . International Journal of Advanced Manufacturing Technology , 16 ( 12 ) : 902 – 908 .
   Web of Science ®Google Scholar
• Taillard , E . 1993 . Benchmarks for basic scheduling problems . European Journal of Operational Research , 64 ( 2 ) : 278 – 285 .
   Web of Science ®Google Scholar
• Taner , M . 2003 . Satisfying due-dates in a job shop with sequence-dependent family setups . International Journal of Production Research , 41 ( 17 ) : 4153 – 4169 .
   Web of Science ®Google Scholar
• Tay , J and Ho , N . 2008 . Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems . Computers & Industrial Engineering , 54 ( 3 ) : 453 – 473 .
   Web of Science ®Google Scholar
• Vepsalainen , A and Morton , T . 1987 . Priority rules for job shops with weighted tardiness costs . Management Science , 33 ( 8 ) : 1035 – 1047 .
   Web of Science ®Google Scholar
• Waikar , A , Sarker , B and Lal , A . 1995 . A comparative study of some priority dispatching rules under different shop loads . Production Planning & Control , 6 ( 4 ) : 301 – 310 .
   Web of Science ®Google Scholar
• Yamada , T . Nakano, R., 1992. A genetic algorithm applicable to large-scale job-shop problems. In: Proceedings of the second international conference on parallel problem solving from nature, 281–290
   Google Scholar