Hybrid genetic algorithm for the flexible job-shop problem under maintenance constraints

Authors:
Nozha Zribi;Pierre Borne
Affiliations:
École Centrale de Lille, Cité scientifique, Villeneuve d'Ascq Cedex, France;École Centrale de Lille, Cité scientifique, Villeneuve d'Ascq Cedex, France
Venue:
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
Year:
2005

Citing 5
Cited 0

Single machine flow-time scheduling with a single breakdown

Acta Informatica
A fast taboo search algorithm for the job shop problem

Management Science
Tabu Search

Tabu Search
New Single Machine and Job-Shop Scheduling Problems with Availability Constraints

Journal of Scheduling
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

Most scheduling literature assumes that machines are available at all times. In this paper, we study the flexible Job-shop scheduling problem where the machine maintenance has to be performed within certain intervals and hence the machine becomes unavailable during the maintenance periods. We propose an assignment technique based successively on the use of different priority rules and a local search procedure. An adequate criteria is developed to evaluate the quality of the assignment. The sequencing problem is solved by a hybrid genetic algorithm which takes into account the constraint of availability periods.