Minimizing the makespan in the non-preemptive job-shop scheduling with limited machine availability

Authors:
Yazid Mati
Affiliations:
Al-Qassim University, College of Business & Economics, Almelaida, P.O. Box 6633, Saudi Arabia
Venue:
Computers and Industrial Engineering
Year:
2010

Citing 9
Cited 0

Job shop scheduling by simulated annealing

Operations Research
A fast taboo search algorithm for the job shop problem

Management Science
An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint

Information Processing Letters
New Single Machine and Job-Shop Scheduling Problems with Availability Constraints

Journal of Scheduling
Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints

Computers and Industrial Engineering
Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints

Computers & Mathematics with Applications
Scheduling two-stage hybrid flow shop with availability constraints

Computers and Operations Research
A survey of scheduling with deterministic machine availability constraints

Computers and Industrial Engineering
Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.