1. Two-machine flowshop scheduling problem with coupled-operations.
- Author
-
Meziani, Nadjat, Oulamara, Ammar, and Boudhar, Mourad
- Subjects
MACHINE learning ,MACHINE theory ,DEEP learning ,COGNITIVE computing ,ARTIFICIAL intelligence - Abstract
This paper addresses a generalization of the coupled-operations scheduling problem in the context of a flow shop environment. We consider the two-machine scheduling problem with the objective of minimizing the makespan. Each job consists of a coupled-operation to be processed first on the first machine and a single operation to be then processed on the second machine. A coupled-operation contains two operations separated by an exact time delay. The single operation can start on the second machine only when the coupled-operation on the first machine is completed. We prove the NP-completeness of two restricted versions of the general problem, whereas we also exhibit several other well solvable cases. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF