Complexity of Project Scheduling Problem with Nonrenewable Resources

Vladimir V. Servakh () and Tatyana A. Shcherbinina ()
Additional contact information
Vladimir V. Servakh: Omsk Branch of Sobolev Institute of Mathematics SB RAS
Tatyana A. Shcherbinina: Omsk State University

A chapter in Operations Research Proceedings 2007, 2008, pp 427-431 from Springer

Abstract: Abstract In the paper we consider the project scheduling problem (PSP) under resource constraints. By the project, we mean some set of jobs the processing of which is aimed at achievement of a definite purpose. Examples of such projects are: mining, development and reconstruction of territories, military and space programs. The planning of the project consists in setting the starting times of job processing. The difficulty is connected with limitation of various material, labor and financial resources.

Date: 2008
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:oprchp:978-3-540-77903-2_66

Ordering information: This item can be ordered from
http://www.springer.com/9783540779032

DOI: 10.1007/978-3-540-77903-2_66

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().