Single-machine scheduling with periodic and flexible periodic maintenance to minimize maximum tardiness

Authors:
Mohammed Sbihi;Christophe Varnier
Affiliations:
Automatic Control and Micro-Mechatronic Systems Department, FEMTO-ST Institute, CNRS - UFC/ENSMM/UTBM, 24 rue A. Savary, Besançon 25000, France;Automatic Control and Micro-Mechatronic Systems Department, FEMTO-ST Institute, CNRS - UFC/ENSMM/UTBM, 24 rue A. Savary, Besançon 25000, France
Venue:
Computers and Industrial Engineering
Year:
2008

Citing 8
Cited 5

Parallel machines scheduling with nonsimultaneous machine available time

Discrete Applied Mathematics
Capacitated two-parallel machines scheduling to minimize sum of job completion times

Discrete Applied Mathematics
Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
Minimizing the makespan in the two-machine no-wait flow-shop with limited machine availability

Computers and Industrial Engineering
Single-machine scheduling with periodic maintenance and nonresumable jobs

Computers and Operations Research
Scheduling two-stage hybrid flow shop with availability constraints

Computers and Operations Research
Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints

Computers and Industrial Engineering
Minimizing the sum of job completion times on capacitated parallel machines

Mathematical and Computer Modelling: An International Journal

Minimizing total completion time on a single machine with a flexible maintenance activity

Computers and Operations Research
Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance

Computers and Operations Research
Heuristics for scheduling problems with an unavailability constraint and position-dependent processing times

Computers and Industrial Engineering
Minimizing maximum tardiness and delivery costs in a batched delivery system

Computers and Industrial Engineering
Integrated production scheduling and maintenance policy for robustness in a single machine

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers a single-machine scheduling problem with several maintenances periods. Specifically, two situations are investigated. In the first one, maintenance periods are periodically fixed: maintenance is required after a periodic time interval. In the second one, the maintenance is not fixed but the maximum continuous working time of the machine which is allowed is determined. The objective is to minimize the maximum tardiness. These problems are known to be strongly NP-hard. We propose some dominance properties and an efficient heuristic. Branch-and-bound algorithms, in which the heuristics, the lower bounds and the dominance properties are incorporated, are proposed and tested computationally.