Journal
COMPUTERS & INDUSTRIAL ENGINEERING
Volume 59, Issue 4, Pages 537-543Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2010.06.010
Keywords
Job-shop scheduling; Availability constraints; Makespan; Disjunctive graph; Taboo thresholding
Funding
- Al-Qassim University [SR-D-006-027]
Ask authors/readers for more resources
This paper addresses the makespan minimization in a job-shop environment where the machines are not available during the whole planning horizon. The disjunctive graph model is used to represent the schedules and the concept of blocks is generalized to include the unavailability periods of machines. To solve the problem, we develop a taboo thresholding heuristic that uses a new block-based neighborhood function. Some sufficient conditions to eliminate the evaluation of non-improving moves are proposed. Experiments performed on existing problem instances of the literature show the efficiency of the proposed heuristic. (C) 2010 Elsevier Ltd. All rights reserved.
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