Resource-constrained scheduling with optional recycling operations |
| |
| Affiliation: | 1. Department of Computer Science, College of Engineering, Mathematics and Physical Sciences, University of Exeter, UK;2. NFV Research Department, Huawei Technologies, China;1. Advanced Manufacturing Institute, King Saud University, Riyadh-11421, Saudi Arabia;2. IT and Environment, Charles Darwin University, 0909 Darwin, Australia;3. School of Information Technology and Engineering, Vellore Institute of Technology, Vellore-632014, Tamilnadu, India |
| |
| 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. |
| |
| Keywords: | Relocation problem Resource-constrained scheduling Optional recycling operations Complexity |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
