Equal Processing Time Bicriteria Scheduling on Parallel Machines

We consider the problem of scheduling jobs on parallel, identical machines so as to minimize a primary and a secondary criteria. All the jobs are assumed to have identical processing times. Polynomial time algorithms, that generate optimal solutions, are presented for various combinations of primary and secondary criteria.

[1]  Hans H. Hinterhuber,et al.  Production economics : issues and challenges for the 90's : proceedings of the Sixth International Working Seminar on Production Economics, Igls, Austria, February 19-23, 1990 , 1991 .

[2]  Chris N. Potts,et al.  Flow shop scheduling with lot streaming , 1989 .

[3]  Mario T. Tabucanon,et al.  Bicriterion scheduling problem in a job shop with parallel processors , 1991 .

[4]  R. G. Vickson,et al.  Two- and three-machine flow shop scheduling problems with equal sized transfer batches , 1992 .

[5]  T.C.E. Cheng.  An Improved Solution Procedure for the Scheduling Problem , 1991 .

[6]  R. Ramesh,et al.  Multicriteria jobshop scheduling , 1989 .

[7]  Richard L. Daniels,et al.  Incorporating preference information into multi-objective scheduling , 1994 .

[8]  Parthasarati Dileepan,et al.  Bicriterion jobshop scheduling with total flowtime and sum of squared lateness , 1991 .

[9]  Ludo Gelders,et al.  Solving a bicriterion scheduling problem , 1980 .

[10]  Rakesh K. Sarin,et al.  Scheduling with multiple performance measures: the one-machine case , 1986 .

[11]  Han Hoogeveen,et al.  Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time , 1994, Oper. Res. Lett..

[12]  S. Chand,et al.  A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness , 1986 .

[13]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[14]  Bernard Grabot,et al.  Dispatching rules in scheduling Dispatching rules in scheduling: a fuzzy approach , 1994 .

[15]  Han Hoogeveen,et al.  Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria , 1996, J. Algorithms.

[16]  James B. Pickens,et al.  Fuzzy goal programming in forestry: an application with special solution problems , 1991 .

[17]  R. Bulfin,et al.  Complexity of single machine, multi-criteria scheduling problems , 1993 .

[18]  Timothy D. Fry,et al.  A framework for single machine multiple objective sequencing research , 1989 .

[19]  Chuen-Lung Chen,et al.  SCHEDULING A SINGLE MACHINE TO MINIMIZE TWO CRITERIA: MAXIMUM TARDINESS AND NUMBER OF TARDY JOBS , 1994 .

[20]  W. Townsend.  Note---Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution , 1977 .

[21]  M. Azizoglu,et al.  Bicriteria scheduling problem involving total tardiness and total earliness penalties , 1991 .

[22]  Thom J. Hodgson,et al.  Interactive Scheduling of a Generalized Flowshop. Part I: Success Through Evolutionary Development , 1981 .

[23]  Subhash C. Sarin,et al.  A two machine bicriteria scheduling problem , 2000 .

[24]  Prabuddha De,et al.  Some clarifications on the bicriteria scheduling of unit execution time jobs on a single machine , 1991, Comput. Oper. Res..

[25]  Robert L. Bulfin,et al.  Scheduling unit processing time jobs on a single machine with multiple criteria , 1990, Comput. Oper. Res..

[26]  K. Lin.  Hybrid algorithm for sequencing with bicriteria , 1983 .

[27]  Robert J. Wittrock,et al.  Scheduling Algorithms for Flexible Flow Lines , 1985, IBM J. Res. Dev..

[28]  Han Hoogeveen.  Minimizing Maximum Promptness and Maximum Lateness on a Single Machine , 1996, Math. Oper. Res..

[29]  Raymond Bausch.  A multicriteria scheduling tool using a branch-and-bound algorithm , 1992 .

[30]  George L. Vairaktarakis,et al.  The single-machine scheduling problem to minimize total tardiness subject to minimum number of tardy jobs , 1995 .

[31]  T. Cheng,et al.  Minimizing flowtime and missed due-dates in single-machine sequencing , 1990 .

[32]  Jean-Charles Billaut,et al.  Multicriteria scheduling , 2005, Eur. J. Oper. Res..