Project scheduling with inventory constraints

Klaus Neumann and Christoph Schwindt

Mathematical Methods of Operations Research, 2003, vol. 56, issue 3, 513-533

Abstract: Inventory constraints refer to so-called cumulative resources, which can store a single or several different products and have a prescribed minimum and maximum inventory, where the inventory is depleted and replenished over time. Some additional applications of cumulative resources, e.g. to investment projects, are also discussed in this paper. We study some properties of the feasible region of the project scheduling problem with inventory constraints and general temporal constraints and especially show how to resolve so-called resource conflicts. The feasible region represents the intersection of a union of polyhedral cones with the polyhedron of time-feasible solutions. These results can be exploited for constructing an efficient branch-and-bound algorithm which enumerates alternatives to avoid stock shortage and surplus by introducing precedence constraints between disjoint sets of events. Finally, we sketch how the procedure can be truncated to a filtered beam search heuristic. An experimental performance analysis shows that problem instances with 100 events and five cumulative resources can be solved in less than one minute. Copyright Springer-Verlag Berlin Heidelberg 2003

Keywords: Key words: Project scheduling; temporal and resource constraints; inventories; branch-and-bound (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860200251 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:56:y:2003:i:3:p:513-533

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860200251

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().