Scheduling a Flow Shop to Minimize the Maximal Lateness Under Arbitrary Precedence Constraints

1997 ◽  
pp. 383-403
Author(s):  
Joanna Józefowska ◽  
Arkadiusz Zimniak
Keyword(s):  
Flow Shop ◽  
Precedence Constraints

Two-machine flow-shop sequencing with sparse precedence constraints

1994 ◽  
Vol 26 (1) ◽  
pp. 173-180 ◽  
Author(s):  
Bongjin Gim ◽  
Guy L. Curry ◽  
Bryan L. Deuermeyer
Keyword(s):  
Flow Shop ◽  
Precedence Constraints

scholarly journals Some Results on Shop Scheduling with S-Precedence Constraints among Job Tasks

Algorithms ◽  
2019 ◽  
Vol 12 (12) ◽  
pp. 250 ◽  
Author(s):  
Alessandro Agnetis ◽  
Fabrizio Rossi ◽  
Stefano Smriglio
Keyword(s):  
Job Shop ◽  
Flow Shop ◽  
Exact Algorithms ◽  
Precedence Constraints ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
Job Tasks ◽  
Shop Scheduling ◽  
Special Cases ◽  
Complexity Status

We address some special cases of job shop and flow shop scheduling problems with s-precedence constraints. Unlike the classical setting, in which precedence constraints among the tasks of a job are finish–start, here the task of a job cannot start before the task preceding it has started. We give polynomial exact algorithms for the following problems: a two-machine job shop with two jobs when recirculation is allowed (i.e., jobs can visit the same machine many times), a two-machine flow shop, and an m-machine flow shop with two jobs. We also point out some special cases whose complexity status is open.

Sign in / Sign up

Export Citation Format

Share Document