Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm

References

• Al-Turki , U , Fedjki , C and Andijani , A . 2001 . Tabu search for a class of single-machine scheduling problems . Comp. & Op. Res. , 28 : 1223 – 1230 .
   Web of Science ®Google Scholar
• Allahverdi , A . 2000 . Minimising mean flowtime in a two-machine flowshop with sequence-independent setup times . Comp. & Op. Res. , 27 : 111 – 127 .
   Google Scholar
• Allahverdi , A . 2003 . The two and m-machines flowshop scheduling problems with bicriteria of makespan and mean flowtime . Euro. J. Op. Res. , 147 : 373 – 396 .
   Web of Science ®Google Scholar
• Allahverdi , A . 2004 . A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness . Comp. & Op. Res. , 31 : 157 – 180 .
   Web of Science ®Google Scholar
• Allahverdi , A and Al-Anzi , FS . 2002 . Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications . Comp. & Op. Res. , 29 : 971 – 994 .
   Web of Science ®Google Scholar
• Allahverdi , A and Sotskov , YN . 2003 . Two-machine flowshop minimum length scheduling problem with random and bounded processing times . Int. Trans. in Op. Res. , 10 : 65 – 76 .
   Google Scholar
• Allahverdi , A , Gupta , JND and Aldowaisan , T . 1999 . A review of scheduling research involving setup considerations . OMEGA Int. J. Manage. Sci. , 27 : 219 – 239 .
   Web of Science ®Google Scholar
• Allahverdi , A , Ng , CT , Cheng , TCE and Kovalyov , MY . 2006 . A survey of scheduling problems with setup times or costs . Euro. J. Op. Res. , (to appear)
   Google Scholar
• Azizoglu , M , Cakmak , E and Kondakci , S . 2001 . A flexible flowshop problem with total flow time minimisation . Euro. J. Op. Res. , 132 : 528 – 538 .
   Web of Science ®Google Scholar
• Baptiste , P , Peridy , L and Pinson , E . 2003 . A branch and bound to minimise the number of late jobs on a single machine with release time constraints . Euro. J. Op. Res. , 144 : 1 – 11 .
   Web of Science ®Google Scholar
• Baykasoglu , A and Dereli , T . 2004 . Heuristic optimisation system for the determination of index positions on CNC magazines with the consideration of cutting tool duplications . Int. J. Prod. Res. , 42 : 1281 – 1303 .
   Web of Science ®Google Scholar
• Chu , C . 1992 . A branch-and-bound algorithm to minimise total tardiness with different release dates . Naval Res. Logist. , 39 : 265 – 283 .
   Web of Science ®Google Scholar
• Daniels , RL and Chambers , RJ . 1990 . Multiobjective flow-shop scheduling . Naval Res. Logist. , 37 : 981 – 995 .
   Web of Science ®Google Scholar
• Della Croce , F , Narayan , V and Tadei , R . 1996 . The two-machine total completion time flow shop problem . Euro. J. Op. Res. , 90 : 227 – 237 .
   Web of Science ®Google Scholar
• Dereli , T and Filiz , IH . 2000 . Allocating optimal positions of cutting tools on ATCs . Robot. & Auton. Syst. , 33 : 155 – 167 .
   Web of Science ®Google Scholar
• Dereli , T , Filiz , IH and Baykasoglu , A . 2001 . Optimising cutting parameters in process planning of prismatic parts by using genetic algorithms . Int. J. Prod. Res. , 39 : 3303 – 3328 .
   Web of Science ®Google Scholar
• Dileepan , P and Sen , T . 1991 . Job lateness in a two-machine flowshop with setup times separated . Comp. & Op. Res. , 18 : 549 – 556 .
   Web of Science ®Google Scholar
• DuPont , L and Ghazvini , FJ . 1997 . Branch and bound algorithm for minimising mean flow time on a single batch processing machine . Int. J. Indust. Eng. , 4 : 197 – 203 .
   Web of Science ®Google Scholar
• Kwok , YK , Karlapalem , K , Ahmad , I and Pun , NM . 1996 . Design and evaluation of data allocation algorithms for distributed multimedia database systems . IEEE J. Select. Areas in Comm. , 14 : 1332 – 1348 .
   Google Scholar
• Manna , DK , Prasad , V and Rajendran , C . 1997 . Pseudopolynomial algorithms for CTV minimisation in single machine scheduling . Comp. & Op. Res. , 24 : 1119 – 1128 .
   Google Scholar
• Ozsu , MT and Valduriez , P . 1991 . Principles of Distributed Database Systems , New Jersey : Prentice-Hall .
   Google Scholar
• Pinedo , M and Chao , X . 1999 . Operations Scheduling with Applications in Manufacturing and Services , Boston, MA : Irwing McGraw-Hill .
   Google Scholar
• Potts , CN and Van Wassenhove , LN . 1982 . A decomposition algorithm for the single machine total tardiness problem . Op. Res. Lett. , 1 : 177 – 181 .
   Google Scholar
• Wang , X and Wu , T . 2002 . Heuristic algorithm for the two-machine flowshop group scheduling problem . J. Syst. Eng. Elec. , 13 : 8 – 16 .
   Google Scholar
• Wu , CC , Lee , WC and You , JM . 2000 . Trade-off solutions in a single-machine scheduling problem for minimising total earliness and maximum tardiness . Int. J. Syst. Sci. , 31 : 639 – 647 .
   Web of Science ®Google Scholar
• Yalaoui , F and Chu , C . 2002 . Parallel machine scheduling to minimise total tardiness . Int. J. Prod. Econ. , 76 : 265 – 279 .
   Web of Science ®Google Scholar
• Yeh , WC and Allahverdi , A . 2004 . A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan and total flowtime . Int. Trans. Op. Res. , 11 : 341 – 359 .
   Google Scholar