Bibliographic Details
| Title: |
Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity. |
| Authors: |
Timkovsky, Vadim G.1,2 timko@cgi.ca |
| Source: |
European Journal of Operational Research. 9/1/2003, Vol. 149 Issue 2, p355-376. 22p. |
| Subjects: |
Connection machines, Parallel computers, Production scheduling, Operations research, Production control, Mathematical programming |
| Abstract: |
This paper surveys, analyses and establishes new polynomial-time reductions among scheduling problems that connect identical parallel machines with unit-time shops and the preemption facility with chain-like precedence constraints in same machine environments. The reductions turn out to be unexpectedly fruitful in clarifying the complexity status of many scheduling problems that were open before. The main purpose of this paper is revealing the relationship between problems in different scheduling classes. [Copyright &y& Elsevier] |
|
Copyright of European Journal of Operational Research is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
