A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs

A fully polynomial approximation scheme for the problem of scheduling n deteriorating jobs on a single machine to minimize makespan is presented. Each algorithm of the scheme runs in O(n5L4ɛ3) time, where L is the number of bits in the binary encoding of the largest numerical parameter in the input, and ɛ is required relative error. The idea behind the scheme is rather general and it can be used to develop fully polynomial approximation schemes for other combinatorial optimization problems. Main feature of the scheme is that it does not require any prior knowledge of lower and/or upper bounds on the value of optimal solutions.

[1]  Oscar H. Ibarra,et al.  Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.

[2]  Sid Browne,et al.  Scheduling Deteriorating Jobs on a Single Processor , 1990, Oper. Res..

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

[4]  Gur Mosheiov,et al.  V-Shaped Policies for Scheduling Deteriorating Jobs , 1991, Oper. Res..

[5]  Eugene Levner,et al.  Fast approximation algorithms for knapsack type problems , 1980 .

[6]  Chris N. Potts,et al.  A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work , 1994, Math. Oper. Res..

[7]  Sushil K. Gupta,et al.  Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem , 1990 .

[8]  D. S. Johnson,et al.  On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees , 1983, Math. Oper. Res..

[9]  U. Yechiali,et al.  Dynamic priority rules for cyclic-type queues , 1989, Advances in Applied Probability.

[10]  Osman Oguz,et al.  A fully polynomial approximation algorithm for the 0-1 knapsack problem , 1981 .

[11]  M Ya Kovalev,et al.  Approximation scheduling algorithms: a survey , 1989 .

[12]  Ellis Horowitz,et al.  Exact and Approximate Algorithms for Scheduling Nonidentical Processors , 1976, JACM.

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

[14]  Jerzy Kyparisis,et al.  Single machine scheduling research , 1987 .

[15]  Eugene L. Lawler,et al.  Fast approximation algorithms for knapsack problems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

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

[17]  Wieslaw Kubiak,et al.  Scheduling deteriorating jobs to minimize makespan , 1998 .

[18]  Anand S. Kunnathur,et al.  Optimal repayment policies for multiple loans , 1987 .