Packing problems and project scheduling models: An integrating perspective

Journal of the Operational Research Society

Volumn 51, Issue 9, 2000, Pages 1083-1092

  Hartmann, S ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

Cutting; Modelling; Packing; Project management; Scheduling

Indexed keywords

EID: 23044518893     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601011     Document Type: Article

References (31)

1. Dyckhoff H (1990). A typology of cutting and packing problems. Eur J Opl Res 44: 145-159.
2. Wottawa M (1996). PACKLIB: Ein ASCII-Datenformat fir Packungsprobleme. Technical Report 96-216, University of Köln.
3. Brucker P (1999). Resource-constrained project scheduling: notation, classification, models, and methods. Eur J Opl Res 112: 3-41.
4. Özdamar L and Ulusoy G (1995). A survey on the resource- constrained project scheduling problem. IIE Trans 27: 574-586.
5. Garey MR and Johnson DS (1979). Computers and intractability: A Guide to The Theory of NP-Completeness. Freeman: San Francisco, California.
6. Demeulemeester EL and Herroelen WS (1996). Modelling setup times, process batches and transfer batches using activity network logic. Eur J Opl Res 89: 355-365.
7. Garey MR, Graham RL, Johnson DS and Yao ACC (1976). Resource constrained scheduling as generalized bin packing. J Combinatorial Theory 21: 257-298.
8. Drexl A and Salewski F (1997). Distribution requirements and compactness constraints in school timetabling. Eur J Opl Res 102: 193-214.
9. Scholl A, Klein R and Jürgens C (1997). BISÖN: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Comput Opns Res 24: 627-645.
10. Schrage L (1970). Solving resource-constrained network problems by implicit enumeration—nonpreemptive case. Opns Res 18: 263-278.
11. Sprecher A (1994). Resource-constrained project scheduling: Exact Methods for the Multi-mode Case. Number 409 in Lecture Notes in Economics and Mathematical Systems. Springer: Berlin.
12. Sprecher A (1999). A competitive branch-and-bound algorithm for the simple assembly line balancing problem. Int J Prod Res 37: 1787-1816.
13. de Reyck B and Herroelen WS (1995). Assembly line balancing by resource-constrained project scheduling—a critical appraisal. Technical Report 9505, University of Leuven.
14. Beasley JE (1985). An exact two-dimensional non-guillotine cutting stock tree search procedure. Opns Res 33: 49-64.
15. Hadjiconstantinou E and Christofides N (1995). An exact algorithm for general, orthogonal, two-dimensional knapsack problems. Eur J Opl Res 83: 39-56.
16. Chu PC and Beasley JE (1998). A genetic algorithm for the multidimensional knapsack problem. J of Heuristics 4: 63-86.
17. Fekete SP and Schepers J (1997). A new exact algorithm for general orthogonal d-dimensional knapsack problems. In: Algorithms - ESA ’97, 5th Annual European Symposium, volume 1284 of Lecture Notes in Computer Science. Springer: Berlin, 144-156.
18. Liu FHF and Hsiao CJ (1997). A three-dimensional pallet loading method for single-size boxes. J Opl Res Soc 48: 726-735.
19. Morabito R and Morales S (1998). A simple and effective recursive procedure for the manufacturer’s pallet loading problem. J Opl Res Soc 49: 819-828.
20. Exeler H (1988). Das Homogene Packproblem in der Betriebswirtschaftlichen Logistik. Physica: Heidelberg.
21. Pritsker AAB, Watters LJ and Wolfe PM (1969). Multiproject scheduling with limited resources: a zero-one programming approach. Mgmt Sci 16: 93-107.
22. Demeulemeester EL and Herroelen WS (1997). New benchmark results for the resource-constrained project scheduling problem. Mgmt Sci 43: 1485-1492.
23. Elmaghraby SE (1977). Activity Networks: Project Planning and Control by Network Models. Wiley: New York.
24. Talbot FB (1982). Resource-constrained project scheduling with time-resource tradeoffs: the nonpreemptive case. Mgmt Sci 28: 1197-1210.
25. Sprecher A and Drexl A (1998). Multi-mode resource- constrained project scheduling by a simple, general and powerful sequencing algorithm. Eur J Opl Res 107: 431-450.
26. Slowinski R (1980). Two approaches to problems of resource allocation among project activities: a comparative study. J Opl Res Soc 31: 711-723.
27. Weglarz J (1981). On certain models of resource allocation problems. Kybernetics 9: 61-66.
28. Bartusch M, Möhring RH and Radermacher FJ (1988). Scheduling project networks with resource constraints and time windows. Annals Opns Res 16: 201-240.
29. Franck B and Schwindt C (1995). Different resource- constrained project scheduling models with minimal and maximal time-lags. Technical Report WIOR-450, University of Karlsruhe.
30. Hartmann S (2000). Project scheduling with multiple modes: a genetic algorithm. Annals Opns Res (forthcoming).
31. Sprecher A, Hartmann S and Drexl A (1997). An exact algorithm for project scheduling with multiple modes. OR Spektrum 19: 195-203.