Parallel machine scheduling with earliness-tardiness penalties and additional resource constraints

This research considers the problem of scheduling jobs on parallel machines with noncommon due dates and additional resource constraints. The objective is to minimize the total absolute deviation of job completion times about the corresponding due dates. All job processing times are assumed to be the same. This problem is motivated by restrictions that occur in the handling and processing of jobs in certain phases of semiconductor manufacturing and other production systems. We examine two special cases. For the first of these, the number of additional resource types and the resource requirements per job are arbitrary. The problem is formulated as a zero-one integer linear program and the Lagrangian relaxation approach is used to obtain tight lower bounds. In the second case, there exist one single type of additional resource and the resource requirements per job are zero or one. This problem is shown to be equivalent to the asymmetric assignment problem.

[1]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[2]  Chelliah Sriskandarajah,et al.  Performance of scheduling algorithms for no-wait flowshops with parallel machines , 1988 .

[3]  J. Blazewicz,et al.  Selected Topics in Scheduling Theory , 1987 .

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

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

[6]  Wieslaw Kubiak,et al.  Minimizing mean flow-time with parallel processors and resource constraints , 1987, Acta Informatica.

[7]  David S. Johnson,et al.  Complexity Results for Multiprocessor Scheduling under Resource Constraints , 1975, SIAM J. Comput..

[8]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[9]  R. V. Helgason,et al.  Algorithms for network programming , 1980 .

[10]  T.C.E. Cheng,et al.  Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties , 1994 .

[11]  Reha Uzsoy,et al.  Minimizing total completion time on batch processing machines , 1993 .

[12]  Jacek Blazewicz,et al.  Scheduling under resource constraints - deterministic models , 1986 .

[13]  Bahram Alidaee,et al.  Minimization of Total Absolute Flow Time Deviation in Single and Multiple Machine Scheduling , 1994 .

[14]  Wieslaw Kubiak,et al.  Scheduling tasks on two processors with deadlines and additional resources , 1986 .

[15]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

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

[17]  Gerd Finke,et al.  New trends in machine scheduling , 1988 .

[18]  Jean-Louis Goffin,et al.  On convergence rates of subgradient optimization methods , 1977, Math. Program..

[19]  Reha Uzsoy,et al.  A REVIEW OF PRODUCTION PLANNING AND SCHEDULING MODELS IN THE SEMICONDUCTOR INDUSTRY PART I: SYSTEM CHARACTERISTICS, PERFORMANCE EVALUATION AND PRODUCTION PLANNING , 1992 .

[20]  Chung-lun Li.  Scheduling to minimize the total resource consumption with a constraint on the sum of completion times , 1995 .

[21]  Dimitri P. Bertsekas,et al.  Linear network optimization - algorithms and codes , 1991 .

[22]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[23]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[24]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .