Simultaneous job scheduling and resource allocation on parallel machines

Annals of Operations Research

Volumn 129, Issue 1-4, 2004, Pages 135-153

  Chen, Zhi Long ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Branch and bound; Column generation; Production scheduling; Resource allocation

Indexed keywords

EID: 3042840546     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/B:ANOR.0000030685.31167.11     Document Type: Article

References (28)

1. Alidaee, B. and A. Ahmadian. (1993). "Two Parallel Machine Sequencing Problems Involving Controllable Job Processing Times." European Journal of Operational Research 70, 335-341.
2. Alidaee, B. and G. Kochenberger. (1996). "A Framework for Machine Scheduling Problems with Controllable Processing Times." Production and Operations Management 5(4), 391-405.
3. Chan, L.M.A., A. Muriel, and D. Simchi-Levi. (1998). "Machine Scheduling, Linear Programming and List Scheduling Heuristics." Operations Research 46, 729-741.
4. Chen, Z.-L., Q. Lu, and G. Tang. (1997). "Single Machine Scheduling with Discretely Controllable Processing Times." Operations Research Letters 21, 69-76.
5. Chen, Z.-L. and W.B. Powell. (1999a). "Solving Parallel Machine Scheduling Problems by Column Generation." INFORMS Journal on Computing 11, 78-94.
6. Chen, Z.-L. and W.B. Powell. (1999b). "A Column Generation Based Decomposition Algorithm for a Parallel Machine Scheduling Just-in-Time Scheduling Problem." European Journal of Operational Research 116, 221-233.
7. Cheng, T.C.E., Z.-L. Chen, and C.-L. Li. (1996). "Single-Machine Scheduling with Trade-Off between Number of Tardy Jobs and Resource Allocation." Operations Research Letters 19, 237-242.
8. Cheng, T.C.E., Z.-L. Chen, C.-L. Li, and B.M.-T. Lin. (1998). "Scheduling to Minimize the Total Compression and Late Costs." Naval Research Logistics 45, 67-82.
9. Cheng, T.C.E. and M.Y. Kovalyov. (1995). "Single Machine Batch Scheduling with Deadlines and Resource Dependent Processing Times." Operations Research Letters 17, 243-249.
10. Daniels, R.L., B.J. Hoopes, and J.B. Mazzola. (1996). "Scheduling Parallel Manufacturing Cells with Resource Flexibility." Management Science 42, 1260-1276.
11. Daniels, R.L., B.J. Hoopes, and J.B. Mazzola. (1997). "An Analysis of Heuristics for the Parallel-Machine Flexible-Resource Scheduling Problem." Annals of Operations Research 70, 439-472.
12. Daniels, R.L. and J.B. Mazzola. (1994). "Flow Shop Scheduling with Resource Flexibility." Operations Research 42, 504-522.
13. Graham, R.L., E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan. (1979). "Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey." Annals of Discrete Mathematics 5, 287-326.
14. Janiak, A. and M.Y. Kovalyov. (1996). "Single Machine Scheduling Subject to Deadlines and Resource Dependent Processing Times." European Journal of Operational Research 94, 284-291.
15. Karp, R.M. (1972). "Reducibility Among Combinatorial Problems." In R.E. Miller and J.W. Thatcher (eds.), Complexity of Computer Computations, pp. 85-103. New York: Plenum.
16. Lasdon, L.S. (1970). Optimization Theory for Large Systems. New York: Macmillan.
17. Lee, C.-Y. and Z.-L. Chen (2000). "Scheduling of Jobs and Maintenance Activities on Parallel Machines." Naval Research Logistics 47, 145-165.
18. Nowicki, E. (1993). "An Approximation Algorithm for the m-Machine Permutation Flow Shop Scheduling Problem with Controllable Processing Times." European Journal of Operational Research 70, 342-349.
19. Nowicki, E. and S. Zdrzalka. (1990). "A Survey of Results for Sequencing Problems with Controllable Processing Times." Discrete Applied Mathematics 25, 271-287.
20. Nowicki, E. and S. Zdrzalka. (1995). "A Bicriterion Approach to Preemptive Scheduling of Parallel Machines with Controllable Job Processing Times." Discrete Applied Mathematics 63, 237-256.
21. Panwalker, S.S. and R. Rajagopalan. (1992). "Single-Machine Sequencing with Controllable Processing Times." European Journal of Operational Research 59, 298-302.
22. Pinedo, M. (1995). Scheduling: Theory, Algorithms, and Systems. Englewood Cliffs, NJ: Prentice Hall.
23. Trick, M.A. (1994). "Scheduling Multiple Variable-Speed Machines." Operations Research 42, 234-248.
24. Van den Akker, J.M., J.A. Hoogeveen, and S.L. van de Velde. (1999). "Parallel Machine Scheduling by Column Generation." Operations Research 47, 862-872.
25. Van Wassenhove, L.N. and K.R. Baker. (1982). "A Bicriterion Approach to Time/Cost Trade-Offs in Sequencing." European Journal of Operational Research 11, 48-52.
26. Vickson, R.G. (1980a). "Choosing the Job Sequence and Processing Times to Minimize Processing Plus Flow Cost on a Single Machine." Operations Research 28, 1155-1167.
27. Vickson, R.G. (1980b). "Two Single-Machine Sequencing Problems Involving Controllable Job Processing Times." AIIE Transactions 12, 258-262.
28. Zhang, F., G. Tang, and Z.-L. Chen. (2001). "A 3/2-Approximation Algorithm for Parallel Machine Scheduling with Controllable Processing Times." Operations Research Letters 29, 41-47.