Chain-reentrant shop with an exact time lag: new results - Archive ouverte HAL Access content directly
Journal Articles International Journal of Production Research Year : 2016

Chain-reentrant shop with an exact time lag: new results

(1, 2) , (2) , (2) , (3)
1
2
3

Abstract

The two-machine chain-reentrant shop scheduling with the objective of minimizing the makespan, assumes that the tasks pass from the first machine to the second and return back to the first machine. In this paper, we consider the same problem in which an exact time lag between the two operations on the first machine is imposed. In Amrouche and Boudhar (2016) the authors proved that this problem is NP-hard in the strong sense in the case of identical time lags l j = L. We propose heuristic algorithms with empirical results for the latter. In addition, we establish a new NP-hardness result and some polynomial cases.
Not file

Dates and versions

hal-02491672 , version 1 (26-02-2020)

Identifiers

Cite

Karim Amrouche, Mourad Boudhar, Mohamed Bendraouche, Farouk Yalaoui. Chain-reentrant shop with an exact time lag: new results. International Journal of Production Research, 2016, 55 (1), pp.285-295. ⟨10.1080/00207543.2016.1205235⟩. ⟨hal-02491672⟩

Collections

CNRS UTT LOSI
7 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More