Flow Shop Scheduling Problems Under Machine–Dependent Precedence Constraints

A.A. Gladky, Y.M. Shafransky and V.A. Strusevich ()
Additional contact information
A.A. Gladky: Institute of Engineering Cybernetics
Y.M. Shafransky: Institute of Engineering Cybernetics
V.A. Strusevich: University of Greenwich

Journal of Combinatorial Optimization, 2004, vol. 8, issue 1, No 2, 13-28

Abstract: 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 (search for similar items in EconPapers)
Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1023/B:JOCO.0000021935.66577.09 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:8:y:2004:i:1:d:10.1023_b:joco.0000021935.66577.09

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/B:JOCO.0000021935.66577.09

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().