Volume 50, Number 2, April-June 2016
Special issue: Research on Optimization and Graph Theory dedicated to COSI 2013
|Page(s)||223 - 232|
|Published online||21 March 2016|
Two machines flow shop with reentrance and exact time lag
1 University of Algiers 3, Faculty of Economics and Management
sciences, 2 street Ahmed Waked, Dely Brahim, Algiers, Algeria.
2 RECITS laboratory, Faculty of Mathematics, USTHB University, BP 32 Bab-Ezzouar, 16111 El-Alia, Algiers, Algeria.
Accepted: 1 June 2015
This paper considers a reentrant flow shop with two machines and exact time lag L, in which each task may be processed in this order M1,M2,M1 and there is an identical time lag between the completion time of the first operation and the start time of the second operation on the first machine. The objective is to minimize the total completion time. We prove the NP-hardness of a special case and we give some special subproblems that can be solved in polynomial time.
Mathematics Subject Classification: 90B35
Key words: Flow shop / reentrance / time lag / makespan / complexity
© EDP Sciences, ROADEF, SMAI 2016
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.