Using integer programming to solve the machine scheduling problem with a flexible maintenance activity
DOI10.1080/09720510.2006.10701195zbMATH Open1105.90023OpenAlexW2108857092MaRDI QIDQ5480415FDOQ5480415
Authors: Jen-Shiang Chen
Publication date: 1 August 2006
Published in: Journal of Statistics and Management Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720510.2006.10701195
Recommendations
- Single-machine scheduling with flexible and periodic maintenance
- Minimizing total completion time on a single machine with a flexible maintenance activity
- Single-machine scheduling with maintenance in a manufacturing system
- Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- Scheduling jobs and maintenance activities on parallel machines
Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)
Cited In (4)
- Single-machine scheduling with flexible and periodic maintenance
- Refinery units maintenance scheduling using integer programming
- Mathematical programming models for competitive two-agent single-machine scheduling with flexible periodic maintenance activities
- Integer models for the interrupt-oriented services of jobs by single machine
This page was built for publication: Using integer programming to solve the machine scheduling problem with a flexible maintenance activity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5480415)