Two-dedicated-machine scheduling problem with precedence relations to minimize makespan
- 151 Downloads
Two-dedicated-parallel-machine scheduling problem with precedence constraints to minimize makespan is considered. This problem originally appeared as a sub-problem in assembly line balancing but it has also its own applications. Complexity and approximation results for this scheduling problem and its special cases with chains of jobs or equal-processing-times are presented.
KeywordsParallel machine scheduling Complexity Assembly line balancing
The work was partially supported by Saint-Etienne Méetropole, France and Labex IMOBS3. The authors thanks also Chris Yukna for his help with English.
- 2.Lawler, E.L., Lenstra, J.K., Rinnoy Kan, A.H.G., Shmoys, D.B.: Sequencing and Scheduling: Algorithms and Complexity, Report BS-8909, Stichting Matematisch Centrum, Amsterdam (1989)Google Scholar
- 5.Tapkan, P., Ozbakir, L., Baykasoglu, A.: Bees algorithm for constrained fuzzy multi-objective two-sided assembly line balancing problem. Optim. Lett. 39(9–10), 1009–1015 (2007)Google Scholar
- 6.Hadda, H., Dridi, N., Hajri-Gabouj, S.: A note on the two-stage hybrid flow shop problem with dedicated machines. Optim. Lett. (2011). doi: 10.1007/s11590-011-0365-4
- 11.Gafarov, E.R., Dolgui, A.: Hard Special Case and Other Complexity Results for SALBP-1. Research Report LIMOS UMR CNRS 6158 (2012)Google Scholar