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.
Original language | English |
---|---|
Pages (from-to) | 39-45 |
Number of pages | 7 |
Journal | Computers and Industrial Engineering |
Volume | 90 |
DOIs | |
State | Published - 15 Dec 2015 |
Keywords
- Complexity
- Optional recycling operations
- Relocation problem
- Resource-constrained scheduling