Minimizing total weighted completion time with uncertain data: a stability approach

DOI10.1134/S0005117910100048zbMath1203.93130WikidataQ57633876 ScholiaQ57633876MaRDI QIDQ612208

Frank Werner, Natalja G. Egorova, Yuri N. Sotskov

Publication date: 3 January 2011

Published in: Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

branch-and-bound algorithmuncertain datasingle-machine scheduling problemoptimal permutation for each possible realizationstability box

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Control/observation systems with incomplete information (93C41) Control/observation systems involving computers (process control, etc.) (93C83) Robust stability (93D09) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

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 ⋮ The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective ⋮ Stability polyhedra of optimal permutation of jobs servicing ⋮ A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the robust single machine scheduling problem
• A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
• Minimizing total weighted flow time of a set of jobs with interval processing times
• Stability of an optimal schedule
• On the calculation of the stability radius of an optimal or an approximate schedule
• 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
• Minimizing total weighted flow time under uncertainty using dominance and a stability box
• Stability in the combinatorial vector optimization problems
• Executing production schedules in the face of uncertainties: a review and some future directions
• Mean flow time minimization with given bounds of processing times
• Schedule execution for two-machine flow-shop with interval processing times
• Stability analysis of an optimal balance for an assembly line with fixed cycle time
• A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
• Sequencing with uncertain numerical data for makespan minimisation
• TWO-MACHINE FLOW-SHOP MINIMUM-LENGTH SCHEDULING WITH INTERVAL PROCESSING TIMES
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Flowshop scheduling problem to minimize total completion time with random and bounded processing times
• Stability and Regularization of Vector Problems of Integer Linear Programming
• 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

This page was built for publication: Minimizing total weighted completion time with uncertain data: a stability approach