Bicriterion Single Machine Scheduling with Resource Dependent Processing Times

A bicriterion problem of scheduling jobs on a single machine is studied. The processing time of each job is a linear decreasing function of the amount of a common discrete resource allocated to the job. A solution is specified by a sequence of the jobs and a resource allocation. The quality of a solution is measured by two criteria, F1 and F2. The first criterion is the maximal or total (weighted) resource consumption, and the second criterion is a regular scheduling criterion depending on the job completion times. Both criteria have to be minimized. General schemes for the construction of the Pareto set and the Pareto set $\epsilon$-approximation are presented. Computational complexities of problems to minimize F1 subject to F_2\le K$ and to minimize F2 subject to $F_1\le K$, where K is any number, are studied for various functions F1 and F2. Algorithms for solving these problems and for the construction of the Pareto set and the Pareto set $\epsilon$-approximation for the corresponding bicriterion problems are presented.

[1]  R. G. Vickson,et al.  Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine , 1980, Oper. Res..

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

[3]  Theodore Joseph Williams,et al.  Analysis and design of hierarchical control systems : with special reference to steel plant operations , 1985 .

[4]  David S. Johnson,et al.  Computers and Inrracrobiliry: A Guide ro the Theory of NP-Completeness , 1979 .

[5]  Sartaj Sahni,et al.  General Techniques for Combinatorial Approximation , 1977, Oper. Res..

[6]  Adam Janiak,et al.  Single machine scheduling problem with a common deadline and resource dependent release dates , 1991 .

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

[8]  Michael H. Rothkopf,et al.  Scheduling Independent Tasks on Parallel Processors , 1966 .

[9]  J. M. Moore,et al.  A Functional Equation and its Application to Resource Allocation and Sequencing Problems , 1969 .

[10]  Eugene L. Lawler,et al.  Optimal Sequencing of a Single Machine Subject to Precedence Constraints , 1973 .

[11]  Chung-Lun Li,et al.  Scheduling to minimize the total compression and late costs , 1998 .

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

[13]  Pierre Hansen,et al.  Bicriterion Path Problems , 1980 .

[14]  Eugene Levner,et al.  Fast approximation algorithm for job sequencing with deadlines , 1981, Discret. Appl. Math..

[15]  J. M. Moore.  An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[16]  J. A. Hoogeveen,et al.  Single-machine bicriteria scheduling , 1992 .

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

[18]  Chung-Lun Li,et al.  Single-machine scheduling with trade-off between number of tardy jobs and resource allocation , 1996, Oper. Res. Lett..

[19]  E. L. Lawler,et al.  A fully polynomial approximation scheme for the total tardiness problem , 1982, Oper. Res. Lett..

[20]  T. C. E. Cheng,et al.  Global Management of Quality Assurance Systems , 1994 .

[21]  T. C. Edwin Cheng,et al.  Single machine batch scheduling with deadlines and resource dependent processing times , 1995, Oper. Res. Lett..