Some results on resource constrained scheduling

IIE Transactions (Institute of Industrial Engineers)

Volumn 36, Issue 1, 2004, Pages 1-9

  Zhang, Guochuan ^a   Cai, Xiaoqiang ^b   Wong, C K ^b,c  

^a ZHEJIANG UNIVERSITY   (China)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; JOB ANALYSIS; PROBLEM SOLVING; RESOURCE ALLOCATION; SET THEORY;

MACHINE SCHEDULING PROBLEM; RESOURCE CONSTRAINED SCHEDULING; WORST CASE RATIO;

SCHEDULING;

EID: 0346639146     PISSN: 0740817X     EISSN: None     Source Type: Journal    
DOI: 10.1080/07408170490257862     Document Type: Article

References (14)

1. Aggoun, A. and Beldiceanu, N. (1993) Extending CHIP in order to solve complex scheduling and placement problems. Mathematical and Computer Modeling, 17, 57-73.
2. Baker, B.S., Brown, D.J. and Katseff, H.P. (1981) A 5/4 algorithm for two-dimensional packing. Journal of Algorithms, 2, 348-368.
3. Baker, B.S., Coffman, E.G. and Rivest, R.L. (1980) Orthogonal packing in two dimensions. SIAM Journal of Computing, 9, 846-855.
4. Baker, B.S. and Schwartz, J.S. (1983) Shelf algorithms for two dimensional packing problems. SIAM Journal of Computing, 12, 508-525.
5. Baptiste, P. and Le Pape, C. (1997) Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. Lecture Notes in Computer Science, 1330, 375-389.
6. Baptiste, P., Le Pape, C. and Nuijten, W. (1999) Satisfiability and time-bound adjustments for cumulative scheduling problems. Annals of Operations Research, 92, 305-333.
7. Brown, D.J., Baker, B.S. and Katseff, H.P. (1982) Lower bounds for on-line two-dimensional packing algorithms. Acta Informatica, 8, 207-225.
8. Csirik, J. and Woeginger, G.J. (1997) Shelf algorithms for on-line strip packing. Information Processing Letters, 63, 171-175.
9. Garey, M.R. and Johnson, D.S. (1979) Computers and Intractability, A Guide to the Theory of NP-completeness, Freeman, San Francisco, CA.
10. Kenyon, C. and Remila, E. (1996) Approximate strip packing. Proceedings of the 37th Annual Symposium in Foundations of Computer Science (FOCS), IEEE Computer Society Press, Los Alamitos, CA, pp. 1-14.
11. Lenstra, J.K. and Shmoys, D.B. (1995) Computing near-optimal schedules, in Scheduling Theory and Its Application, Chrétienne P., Coffman, E.G., Lenstra, J.K., and Liu, Z. (eds.), J Wiley & Sons, Chicester, pp. 1-14.
12. Li, C.-L., Cai, X. and Lee, C.-Y. (1998) Scheduling with multiple-job-on-one-processor pattern. IIE Transactions, 30, 433-445.
13. Srivastav, A. and Stangier, P. (1997) Tight approximations for resource constrained scheduling and bin packing. Discrete Applied Mathematics, 79, 223-245.
14. Steinberg, A. (1997) A strip-packing algorithm with absolute performance bound 2. SIAM Journal of Computing, 26, 401-409.