Single-machine scheduling with workload-dependent maintenance duration to minimize maximum lateness
Summary: A single-machine scheduling problem with a mandatory maintenance whose duration is workload-dependent is considered. The start time of the maintenance is restricted to a time window. The objective is to determine the start time of the maintenance and schedule all the jobs to the machine such that the maximum lateness is minimized. An approximation algorithm based on the classical Earliest Due Date first rule is proposed. It is showed that the proposed algorithm is optimal for some special cases and that it has a tight bound for the scheduling problem under consideration.
- Scheduling jobs with maintenance subject to load-dependent duration on a single machine
- Single-machine scheduling with periodic maintenance and nonresumable jobs.
- Scheduling position-dependent maintenance operations
- Approximation algorithms for the single-machine scheduling with a period of maintenance
- Approximation algorithms for scheduling with a variable machine maintenance
- Approximation algorithms for scheduling with a variable machine maintenance
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies
- Mathematical programming models for competitive two-agent single-machine scheduling with flexible periodic maintenance activities
- Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time
- Minimizing the maximum lateness in a single-machine scheduling problem with the normal time-dependent and job-dependent learning effect
- Rescheduling for machine disruption to minimize makespan and maximum lateness
- Scheduling. Theory, algorithms, and systems.
- Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval
- Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance
- Single-machine scheduling with periodic maintenance to minimize makespan
- The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect
- Scheduling jobs with maintenance subject to load-dependent duration on a single machine
- Scheduling position-dependent maintenance operations
- Single-machine scheduling with piece-rate maintenance and interval constrained position-dependent processing times
- scientific article; zbMATH DE number 7235437 (Why is no real title available?)
- Minimizing total completion time on a single machine with a flexible maintenance activity
- Single-machine scheduling with fixed periodic preventive maintenance to minimise the total weighted completion times
- Integrated maintenance and production scheduling on a single machine with time-based and job-specific deterioration: a matheuristic approach
This page was built for publication: Single-machine scheduling with workload-dependent maintenance duration to minimize maximum lateness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1666458)
