Skip to Main content Skip to Navigation
Journal articles

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

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.
Document type :
Journal articles
Complete list of metadata

https://hal-utt.archives-ouvertes.fr/hal-02491672
Contributor : Daniel Gavrysiak Connect in order to contact the contributor
Submitted on : Wednesday, February 26, 2020 - 11:57:31 AM
Last modification on : Friday, August 27, 2021 - 3:14:07 PM

Identifiers

Collections

UTT | CNRS

`

Citation

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

Share

Metrics

Record views

70