Some Results on Shop Scheduling with S-Precedence Constraints among Job Tasks
Keyword(s):
Job Shop
◽
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.
2004 ◽
Vol 8
(1)
◽
pp. 13-28
◽
Keyword(s):
2015 ◽
Vol 775
◽
pp. 458-463
◽
An improved sheep flock heredity algorithm for job shop scheduling and flow shop scheduling problems
2011 ◽
Vol 2
(4)
◽
pp. 749-764
◽
Keyword(s):
Job Shop
◽
2020 ◽
Vol 33
(1)
◽
Keyword(s):
2007 ◽
Vol 184
(2)
◽
pp. 945-949
◽
Keyword(s):