Robust scheduling of parallel machines considering total flow time
- 1 March 2016
- journal article
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 93, 152-161
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Robust scheduling on a single machine to minimize total flow timeComputers & Operations Research, 2012
- Two branch-and-bound algorithms for the robust parallel machine scheduling problemComputers & Operations Research, 2012
- Approximating a two-machine flow shop scheduling under discrete scenario uncertaintyEuropean Journal of Operational Research, 2012
- Optimization of schedule robustness and stability under random machine breakdowns and processing time variabilityIIE Transactions, 2009
- An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problemsComputers & Operations Research, 2009
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: Models, relaxations and algorithmsApplied Mathematical Modelling, 2009
- Robustness and stability measures for scheduling: single-machine environmentIIE Transactions, 2008
- Job sequencing and due date assignment in a single machine shop with uncertain processing timesEuropean Journal of Operational Research, 2008
- A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problemsEuropean Journal of Operational Research, 1993
- A state-of-the-art review of parallel-machine scheduling researchEuropean Journal of Operational Research, 1990