Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
Author:
- Maciej DrwalMDMaciej Drwal
- 1 March 2018
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 91, 13-20
Abstract
No abstract availableKeywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterionOperations Research Letters, 2016
- Robust single machine scheduling for minimizing total flow time in the presence of uncertain processing timesComputers & Industrial Engineering, 2014
- Minimizing the number of late jobs on a single machine under due date uncertaintyJournal of Scheduling, 2010
- Min–max and min–max regret versions of combinatorial optimization problems: A surveyEuropean Journal of Operational Research, 2009
- Minimizing total weighted flow time of a set of jobs with interval processing timesMathematical and Computer Modelling, 2009
- Complexity of single machine scheduling problems under scenario-based uncertaintyOperations Research Letters, 2008
- Complexity of minimizing the total flow time with interval data and minmax regret criterionDiscrete Applied Mathematics, 2006
- A Mixed Integer Programming Formulation for the Total Flow Time Single Machine Robust Scheduling Problem with Interval DataJournal of Mathematical Modelling and Algorithms, 2006
- An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterionMathematical Programming, 2004
- On the complexity of a class of combinatorial optimization problems with uncertaintyMathematical Programming, 2001