Scheduling jobs and maintenance activities on parallel machines
From MaRDI portal
Publication:2359536
DOI10.1007/s12351-012-0130-1zbMath1365.90147OpenAlexW2020815074MaRDI QIDQ2359536
Imed Kacem, Maher Rebai, Kondo Hloindo Adjallah
Publication date: 29 June 2017
Published in: Operational Research. An International Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12351-012-0130-1
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Developing a flexible manufacturing control system considering mixed uncertain predictive maintenance model: a simulation-based optimization approach ⋮ Production, maintenance and resource scheduling: a review
Cites Work
- Unnamed Item
- Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
- An integrated production and preventive maintenance planning model
- Approximation algorithms for single machine scheduling with one unavailability period
- Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times
- Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval
- Single machine earliness and tardiness scheduling
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
- Scheduling with limited machine availability
- Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
- Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- Scheduling jobs and maintenance activities on parallel machines
- Two-machine flow shops with limited machine availability
This page was built for publication: Scheduling jobs and maintenance activities on parallel machines
