Disjunctive and time-indexed formulations for non-preemptive job shop scheduling with resource availability constraints
| Autor: | Stéphane Dauzère-Pérès, Riad Aggoune, S. Azem |
|---|---|
| Přispěvatelé: | Luxembourg Institute of Science and Technology (LIST), Département Sciences de la Fabrication et Logistique (SFL-ENSMSE), École des Mines de Saint-Étienne (Mines Saint-Étienne MSE), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-CMP-GC |
| Rok vydání: | 2007 |
| Předmět: |
Disjunctive graph
Mathematical optimization Job shop scheduling Operations research Computer science Preemption Scheduling (production processes) Combinatorial optimization [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO] Flow shop scheduling Unavailability Preventive maintenance ComputingMilieux_MISCELLANEOUS |
| Zdroj: | 2007 IEEE International Conference on Industrial Engineering and Engineering Management 2007 IEEE International Conference on Industrial Engineering and Engineering Management, Dec 2007, Singapore, France. ⟨10.1109/IEEM.2007.4419298⟩ |
| DOI: | 10.1109/ieem.2007.4419298 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|