Resource-constrained scheduling with optional recycling operations. (December 2015)

• Record Type: Journal Article
• Authors: Lin, Bertrand M.T.
• Is Part Of: Computers & industrial engineering. Volume 90(2015)
• Page Start: 39
• Page End: 45
• Publication Date: 2015-12
• Subjects: Relocation problem -- Resource-constrained scheduling -- Optional recycling operations -- Complexity; Engineering -- Data processing -- Periodicals; Industrial engineering -- Periodicals; 620.00285
• DOI: 10.1016/j.cie.2015.08.014
• Languages: English
• ISSNs: 0360-8352

Abstract

Highlights: A new variant of resource-constrained scheduling problem is introduced. The concept of optional operations is proposed. Complexity status of the problem is discussed. Abstract: This paper introduces a scheduling problem with a variant of resource constraint that stems from a relocation project. We also propose the concept of optional recycling operations, in which recycling operations are separated from the processing of jobs and recycling operations are exercised only when necessary. An integer program is proposed to formulate the problem and facilitate complexity classification. We propose a pseudo-polynomial time dynamic program, and then classify the complexity status of several restricted cases.