Journal
COMPUTERS & INDUSTRIAL ENGINEERING
Volume 125, Issue -, Pages 1-8Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2018.08.008
Keywords
Scheduling; Job shop; Metaheuristic; Availability constraints; Disjunctive graph
Funding
- ANRT (Association Nationale de la Recherche Technique) [2015/1455]
- CIFRE funds
- STMicroelectronics
- Mines Saint-Etienne
Ask authors/readers for more resources
This paper addresses the job-shop scheduling problem in which the machines are not available during the whole planning horizon and with the objective of minimizing the makespan. The disjunctive graph model is used to represent job sequences and to adapt and extend known structural properties of the classical job-shop scheduling problem to the problem at hand. These results have been included in two metaheuristics (Simulated Annealing and Tabu Search) with specific neighborhood functions and diversification structures. Computational experiments on problem instances of the literature show that our Tabu Search approach outperforms Simulated Annealing and existing approaches.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available