Gladky, A.A., Shafransky, Y.M. and Strusevich, V.A. (2004) Flow shop scheduling problems under machine–dependent precedence constraints. Journal of Combinatorial Optimization, 8 (1). pp. 13-28. ISSN 1382-6905 (Print), 1573-2886 (Online) (doi:https://doi.org/10.1023/B:JOCO.0000021935.66577.09)

Full text not available from this repository.

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.

Item Type:	Article
Additional Information:	[1] Accepted: 19 September 2002. [2] Published in print: 1 March 2004.
Uncontrolled Keywords:	flow shop, precedence constraints, complexity, polynomial-time algorithm
Subjects:	Q Science > QA Mathematics > QA76 Computer software T Technology > TJ Mechanical engineering and machinery
Pre-2014 Departments:	School of Computing & Mathematical Sciences School of Computing & Mathematical Sciences > Department of Mathematical Sciences School of Computing & Mathematical Sciences > Statistics & Operational Research Group
Related URLs:	Publisher Publisher Organisation
Last Modified:	14 Oct 2016 09:01
URI:	http://gala.gre.ac.uk/id/eprint/724

Actions (login required)

View Item