Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates
From MaRDI portal
Publication:1652182
DOI10.1016/j.cor.2016.11.008zbMath1391.90204OpenAlexW2552618837MaRDI QIDQ1652182
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.11.008
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Reliability, availability, maintenance, inspection in operations research (90B25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Equivalence of some different maintenance activities in single-machine scheduling, The parallel AGV scheduling problem with battery constraints: a new formulation and a matheuristic approach, Single-machine scheduling with maintenance activities and rejection, A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach, Developing a flexible manufacturing control system considering mixed uncertain predictive maintenance model: a simulation-based optimization approach, Single-machine common due date total earliness/tardiness scheduling with machine unavailability
Cites Work
- Unnamed Item
- Minimizing total completion time on a single machine with a flexible maintenance activity
- Single machine flow-time scheduling with scheduled maintenance
- Single-machine scheduling with periodic maintenance to minimize makespan
- Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
- Scheduling a maintenance activity to minimize total weighted completion-time
- Single machine flow-time scheduling with a single breakdown
- Machine scheduling with availability constraints
- Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance
- Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
- Single-machine scheduling with periodic maintenance and nonresumable jobs.
- An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
- Scheduling with limited machine availability
- A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
- Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint
- 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
- Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- Machine scheduling with an availability constraint
- Scheduling the maintenance on a single machine
- Single-machine scheduling with flexible and periodic maintenance
