Robust single machine scheduling with a flexible maintenance activity
Authors:
- Paolo DettiPDPaolo Detti
- Gaia NicosiaGNGaia Nicosia
- Andrea PacificiAPAndrea Pacifici
- Garazi Zabalo Manrique de LaraGLGarazi Zabalo Manrique de Lara
- 1 July 2019
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 107, 19-31
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Robust single machine scheduling with external-party jobsIFAC-PapersOnLine, 2016
- Scheduling two agent task chains with a central selection mechanismJournal of Scheduling, 2015
- Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion timeInformation Sciences, 2013
- A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machinesOptimization Letters, 2013
- Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespanEuropean Journal of Operational Research, 2008
- An approximation algorithm for interval data minmax regret combinatorial optimization problemsInformation Processing Letters, 2006
- Single machine scheduling with a restricted rate‐modifying activityNaval Research Logistics (NRL), 2005
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage ProductionManagement Science, 1995
- Single machine flow-time scheduling with a single breakdownActa Informatica, 1989
- Fast Approximation Algorithms for the Knapsack and Sum of Subset ProblemsJournal of the ACM, 1975