Diessel, ErikErikDiesselAckermann, HeinerHeinerAckermann2022-03-062022-03-062019https://publica.fraunhofer.de/handle/publica/25854710.1016/j.orl.2019.04.004We introduce the Domino Sequencing problem, a scheduling problem with special sequence-dependent setup times. For each job there are corresponding start and end states and . When job is scheduled immediately before job , a setup time of 1 is needed if . We present polynomial-time algorithms for various versions. When jobs are partitioned into families, we show that the problem becomes -hard and present a fixed-parameter tractable algorithm.ensequence-dependent setup timejob familiesEulerian extension problemdynamic programmingfixed-parameter tractability003300006519journal article