Robust single machine scheduling with a flexible maintenance activity
From MaRDI portal
Publication:1738814
DOI10.1016/j.cor.2019.03.001zbMath1458.90282MaRDI QIDQ1738814
Paolo Detti, Gaia Nicosia, Andrea Pacifici, Garazi Zabalo Manrique de Lara
Publication date: 18 April 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Related Items (9)
Multi-machine preventive maintenance scheduling with imperfect interventions: a restless bandit approach ⋮ Minimizing maximum tardiness on a single machine with family setup times and machine disruption ⋮ Minimizing the sum of completion times on a single machine with health index and flexible maintenance operations ⋮ Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity ⋮ A state-of-the-art survey on multi-scenario scheduling ⋮ Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs ⋮ Simultaneous predictive maintenance and inventory policy in a continuously monitoring system using simulation optimization ⋮ A lexicographic optimization approach for a bi-objective parallel-machine scheduling problem minimizing total quality loss and total tardiness ⋮ Optimally rescheduling jobs with a last-in-first-out buffer
Cites Work
- Unnamed Item
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
- Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time
- Minimizing total completion time on a single machine with a flexible maintenance activity
- On the robust single machine scheduling problem
- A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- Single machine flow-time scheduling with a single breakdown
- Robust discrete optimization and its applications
- An efficient fully polynomial approximation scheme for the Subset-Sum problem.
- Robust scheduling on a single machine to minimize total flow time
- Scheduling two agent task chains with a central selection mechanism
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines
- Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- Machine scheduling with an availability constraint
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
- On ordered weighted averaging aggregation operators in multicriteria decisionmaking
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Single machine scheduling with a restricted rate-modifying activity
- Robust Optimization of Large-Scale Systems
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
This page was built for publication: Robust single machine scheduling with a flexible maintenance activity
