Minimizing total weighted flow time of a set of jobs with interval processing times
From MaRDI portal
Publication:969917
DOI10.1016/j.mcm.2009.03.006zbMath1185.90094OpenAlexW2042025920MaRDI QIDQ969917
Tsung-Chyan Lai, Natalja G. Egorova, Yuri N. Sotskov
Publication date: 8 May 2010
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2009.03.006
Related Items
Optimality region for job permutation in single-machine scheduling with uncertain processing times, Single machine scheduling problem with interval processing times to minimize mean weighted completion time, Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty, The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective, Measures of problem uncertainty for scheduling with interval processing times, Minimizing total weighted completion time with uncertain data: a stability approach, Stability polyhedra of optimal permutation of jobs servicing, Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness, A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines, Uncertainty measure for the Bellman-Johnson problem with interval processing times, A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure, Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times, Minimizing total weighted flow time under uncertainty using dominance and a stability box, A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times, Single machine scheduling problem with interval processing times and total completion time objective, Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times, Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times, The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times
Cites Work
- Unnamed Item
- Unnamed Item
- On the robust single machine scheduling problem
- Scheduling for stability in single-machine production systems
- Robust discrete optimization and its applications
- Optimal makespan scheduling with given bounds of processing times
- Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times
- Minmax regret solutions for minimax optimization problems with uncertainty
- A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates
- Executing production schedules in the face of uncertainties: a review and some future directions
- Benchmarks for basic scheduling problems
- Schedule execution for two-machine flow-shop with interval processing times
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- The complexity of machine scheduling for stability with a single disrupted job
- Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
- Sequencing with uncertain numerical data for makespan minimisation
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Flowshop scheduling problem to minimize total completion time with random and bounded processing times
- Two-machine flowshop minimum-length scheduling problem with random and bounded processing times
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- REGULARITY RESULTS FOR TIME-DEPENDENT VARIATIONAL AND QUASI-VARIATIONAL INEQUALITIES AND APPLICATION TO THE CALCULATION OF DYNAMIC TRAFFIC NETWORK
- On the complexity of a class of combinatorial optimization problems with uncertainty
