A bicriteria approach to maximize the weighted number of just-in-time jobs and to minimize the total resource consumption cost in a two-machine flow-shop scheduling system

We analyze a two-machine flow-shop scheduling problem in which the job processing times are controllable by the allocation of resources to the job operations and the resources can be used in discrete quantities. We provide a bicriteria analysis of the problem where the first criterion is to maximize the weighted number of just-in-time jobs and the second criterion is to minimize the total resource consumption cost. We prove that although the problem is known to be NP-hard even for constant processing times, a pseudo-polynomial time algorithm for its solution exists. In addition, we show how the pseudo-polynomial time algorithm can be converted into a two-dimensional fully polynomial approximation scheme for finding an approximate Pareto solution.

[1]  Dvir Shabtay,et al.  A bicriteria approach to minimize number of tardy jobs and resource consumption in scheduling a single machine , 2009 .

[2]  Dvir Shabtay,et al.  Minimizing the total weighted flow time in a single machine with controllable processing times , 2004, Comput. Oper. Res..

[3]  Byung-Cheon Choi,et al.  Maximizing the weighted number of just-in-time jobs in flow shop scheduling , 2007 .

[4]  M. Selim Akturk,et al.  A new bounding mechanism for the CNC machine scheduling problems with controllable processing times , 2005, Eur. J. Oper. Res..

[5]  Adam Janiak,et al.  One-machine scheduling with allocation of continuously-divisible resource and with no precedence constraints , 1987, Kybernetika.

[6]  Kunihiko Hiraishi,et al.  Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs , 2000, Comput. Oper. Res..

[7]  Han Hoogeveen,et al.  Some Comments on Sequencing with Controllable Processing Times , 2002, Computing.

[8]  Eugeniusz Nowicki,et al.  A survey of results for sequencing problems with controllable processing times , 1990, Discret. Appl. Math..

[9]  Raymond G. Vickson,et al.  Two Single Machine Sequencing Problems Involving Controllable Job Processing Times , 1980 .

[10]  G. Steiner,et al.  The no-wait two-machine flow shop scheduling problem with convex resource-dependent processing times , 2007 .

[11]  Bahram Alidaee,et al.  Two parallel machine sequencing problems involving controllable job processing times , 1993 .

[12]  C. T. Ng,et al.  Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time , 2005, Ann. Oper. Res..

[13]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[14]  Jacek Blazewicz,et al.  Scheduling in Computer and Manufacturing Systems , 1990 .

[15]  Ling-Huey Su,et al.  Scheduling parallel machines with resource-dependent processing times , 2009 .

[16]  Michael A. Trick,et al.  Scheduling Multiple Variable-Speed Machines , 1990, Oper. Res..

[17]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[18]  Dvir Shabtay,et al.  A survey of scheduling with controllable processing times , 2007, Discret. Appl. Math..

[19]  Dvir Shabtay,et al.  Optimization of the machining economics problem for a multistage transfer machine under failure, opportunistic and integrated replacement strategies , 2003 .

[20]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[21]  Adam Janiak,et al.  Single machine scheduling subject to deadlines and resource dependent processing times , 1996 .

[22]  Vitaly A. Strusevich,et al.  Pre-Emptive Scheduling Problems with Controllable Processing Times , 2005, J. Sched..

[23]  Dvir Shabtay,et al.  Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine , 2004, Comput. Oper. Res..

[24]  Richard L. Daniels,et al.  A multi-objective approach to resource allocation in single machine scheduling , 1990 .

[25]  Errol L. Lloyd,et al.  On the k -coloring of intervals , 1995 .

[26]  Shao Chin Sung,et al.  A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines , 2005, Comput. Oper. Res..

[27]  Shao Chin Sung,et al.  Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel Machines , 2005, J. Sched..

[28]  Adam Janiak,et al.  Resource Management in Machine Scheduling Problems: A Survey , 2007 .

[29]  T. C. Edwin Cheng,et al.  Bicriterion Single Machine Scheduling with Resource Dependent Processing Times , 1998, SIAM J. Optim..

[30]  Sartaj Sahni,et al.  Algorithms for Scheduling Independent Tasks , 1976, J. ACM.

[31]  Adam Janiak.  Minimization of the makespan in a two-machine problem under given resource constraints , 1998, Eur. J. Oper. Res..

[32]  Gur Mosheiov,et al.  Single machine scheduling to minimize the number of early and tardy jobs , 1996, Comput. Oper. Res..

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

[34]  Dvir Shabtay,et al.  Just-in-time scheduling with controllable processing times on parallel machines , 2010, J. Comb. Optim..

[35]  K. R. Baker,et al.  A bicriterion approach to time/cost trade-offs in sequencing , 1982 .