Disjunctive and time-indexed formulations for non-preemptive job shop scheduling with resource availability constraints

In many real industrial situations machines may be non-available for processing jobs for instance when a machine breaks down or when a preventive maintenance activity is scheduled. This paper deals with the job shop scheduling problem when machines are not continuously available and this for better...

Full description

Saved in:
Bibliographic Details
Published in2007 IEEE International Conference on Industrial Engineering and Engineering Management pp. 787 - 791
Main Authors Azem, S., Aggoune, R., Dauzere-Peres, S.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2007
Subjects
Availability
Availability constraints
combinatorial optimization
Communication industry
Constraint optimization
Job shop scheduling
Linear programming
machine availability Mixed Integer and Linear Programming
Mathematical model
Mining industry
Preventive maintenance
Production
production scheduling
shop-floor scheduling
Single machine scheduling
Online AccessGet full text

Cover

More Information
Summary:In many real industrial situations machines may be non-available for processing jobs for instance when a machine breaks down or when a preventive maintenance activity is scheduled. This paper deals with the job shop scheduling problem when machines are not continuously available and this for better modeling of the industry reality. We assume that no preemption is allowed and we introduce flexibility on machine unavailability periods by assuming that these latter are planned in time windows. This flexibility is relevant when scheduling preventive machine maintenance. Two mathematical models are presented and compared. The first one is based on the disjunctive graph and the second one is time-indexed. Numerical experiments on generated benchmarks were performed with ILOG CPLEX 10.
ISBN:1424415284
9781424415281
ISSN:2157-3611
2157-362X
DOI:10.1109/IEEM.2007.4419298