Flow Shop Scheduling Problems Under Machine–Dependent Precedence Constraints |
| |
| Authors: | AA Gladky YM Shafransky VA Strusevich |
| |
| Institution: | (1) National Academy of Sciences of Belarus, Institute of Engineering Cybernetics, Minsk, Republic of Belarus;(2) School of Computing and Mathematical Sciences, University of Greenwich, London, UK |
| |
| Abstract: | The paper considers the flow shop scheduling problems to minimize the makespan, provided that an individual precedence relation is specified on each machine. A fairly complete complexity classification of problems with two and three machines is obtained. |
| |
| Keywords: | flow shop precedence constraints complexity polynomial-time algorithm |
| 本文献已被 SpringerLink 等数据库收录！ |
