Two-dedicated-parallel-machine scheduling problem with precedence
constraints to minimize makespan is considered. This problem originally ap-
peared as a sub-problem in assembly line balancing but it has also its own
applications. Complexity and approximation results for this scheduling prob-
lem and its special cases with chains of jobs or equal-processing-times are
presented.
E.R. Gafarov, A.Dolgui (2014). Two Dedicated Machines Scheduling Problem in Two-Sided Assembly Lines. Optimization Letters. 8. 1443-1451 (journal impact factor 2018: 1.399). Q1