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

Computers and Operations Research

Volumn 30, Issue 13, 2003, Pages 1945-1958

  Ventura, José A ^a   Kim, Daecheol ^b  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b AspenTech   (South Korea)

Author keywords

Earliness tardiness penalties; Lagrangian relaxation; Parallel machine scheduling; Resource constraints

Indexed keywords

CONSTRAINT THEORY; JUST IN TIME PRODUCTION; LAGRANGE MULTIPLIERS; PROBLEM SOLVING; RELAXATION PROCESSES; RESOURCE ALLOCATION; SCHEDULING;

PARALLEL MACHINE SCHEDULING;

PARALLEL PROCESSING SYSTEMS;

MACHINERY;

EID: 0042812478     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(02)00118-1     Document Type: Article

References (26)

1. Baker KR. Introduction to sequencing and scheduling. New York; NY: Wiley, 1974.
2. Pinedo M. Scheduling: theory, algorithms and systems. Englewood Cliffs, NJ: Prentice-Hall, 1995.
3. Uzsoy R, Lee CY, Martin-Vega LA. A review of production planning and scheduling models in the semiconductor industry, Part I: system characteristics, performance evaluation and production planning. IIE Transactions on Scheduling and Logistics 1992;24:47-61.
4. Chandru V, Lee CY, Uzsoy R. Minimizing total completion time on batch processing machines. International Journal of Production Research 1993;31:2097-121.
5. Blazewicz J. Selected topics in scheduling theory. Annals of Discrete Mathematics 1987;31:1-60.
6. Blazewicz J, Finke G, Haupt R, Schmidt G. New trends in machine scheduling. European Journal of Operational Research 1993;37:303-17.
7. Blazewicz J, Ecker K, Schmidt G, Weglarz J. Scheduling in computer and manufacturing systems. Berlin, Germany: Springer, 1993.
8. Alidaee B, Ahmadian A. Two parallel machine scheduling problems involving controlable job processing times. European Journal of Operational Research 1993;70:335-41.
9. Alidaee B, Kochenberger G. A framework for machine scheduling problems with controlable processing times. Journal of Production and Operations Management 1996;5:391-405.
10. Sriskandarajah C. Performance of scheduling algorithms for no-wait flowshops with parallel machines. European Journal of Operational Research 1993;70:365-78.
11. Bahram A, Kochenberger GA, Ahmadian A. Minimization of total absolute flow time deviation in single and multiple machine scheduling. Journal of Operational Research Society 1994;45:1077-87.
12. Cheng TCE, Chen Z-L. Parallel-machine scheduling problems with earliness and tardiness penalties. Journal of Operational Research Society 1994;45:685-95.
13. Li C-L. Scheduling to minimize the total resource consumption with a constraint on the sum of completion times. European Journal of Operational Research 1995;80:381-8.
14. Garey MR, Johnson DS. Complexity results for multiprocessor scheduling under resource constraints. SIAM Journal on Computing 1975;4:397-411.
15. Blazewicz J, Barcelo J, Kubiak W, Rock H. Scheduling tasks on two processors with deadlines and additional resources. European Journal of Operational Research 1986;26:364-70.
16. Blazewicz J, Kubiak W, Rock H, Szwarcfiter J. Minimizing mean flow-time with parallel processors and resource constraints. Acta Informatica 1987;24:513-24.
17. Baker KR, Scudder GD. Sequencing with earliness and tardiness penalties: a review. Operations Research 1990;38: 22-36.
18. Blazewicz J, Cellary W, Slowinski R, Weglarz J. Scheduling under resource constraints-deterministic models. Annals of Operations Research 1986;7:1-359.
19. Geofrion AM. Lagrangian relaxation in integer programming. Mathematical Programming Study 1974;2:82-114.
20. Held M, Karp RM. The traveling-salesman problem and minimum spanning tree. Operations Research 1970;18: 1138-62.
21. Held M, Karp RM. The traveling-salesman problem and minimum spanning tree part II. Mathematical Programming 1971;1:6-25.
22. Held M, Wolfe P, Crowder HD. Validation of subgradient optimization. Mathematical Programming 1974;6:62-88.
23. Goffin JL. On the convergence rates of subgradient optimization method. Mathematical Programming 1977;13: 329-47.
24. Kennington JL, Helgason RV. Algorithms for network programming. New York; NY: Wiley, 1980.
25. Bertsekas DP. Linear network optimization: algorithms and codes. Cambridge, MA: MIT Press, 1991.
26. Kuhn NW. The Hungarian method for the assignment problem. Naval Research Logistics Quarterly 1955;2:83-97.