A family of inequalities valid for the robust single machine scheduling polyhedron

DOI10.1016/J.COR.2009.12.001MaRDI QIDQ2270446zbMATH OpenOpenAlexFDO

Authors Ming Zhao, I. R. jun. de Farias, Hong-xia Zhao

Publication date 18 March 2010

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2009.12.001

zbMATH Keywords

branch-and-cutmixed-integer programmingrobust optimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A polyhedral approach to single-machine scheduling problems.
• Single machine scheduling with scenarios
• On the robust single machine scheduling problem
• Approximating Single Machine Scheduling with Scenarios
• Minimizing the weighted sum of completion times under processing time uncertainty

Cites work

• A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
• A polyhedral study of the cardinality constrained knapsack problem
• Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables
• Formulating the single machine sequencing problem with release dates as a mixed integer program
• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 846900 (Why is no real title available?)
• Introduction to Stochastic Programming
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• On the facial structure of scheduling polyhedra
• On the robust single machine scheduling problem
• Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound
• Robust discrete optimization and its applications
• Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
• Structure of a simple scheduling polyhedron

Cited in

(19)

• A polyhedral approach to single-machine scheduling problems.
• Distributionally robust single machine scheduling with the total tardiness criterion
• Distributionally robust single machine scheduling with risk aversion
• Distributionally robust scheduling on parallel machines under moment uncertainty
• Scheduling in multi-scenario environment with an agreeable condition on job processing times
• Parameterized multi-scenario single-machine scheduling problems
• An approximation scheme for the bi-scenario sum of completion times trade-off problem
• A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
• Single machine scheduling problems with uncertain parameters and the OWA criterion
• Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope
• Minimizing value-at-risk in single-machine scheduling
• Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems
• Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry
• A state-of-the-art survey on multi-scenario scheduling
• Recoverable robust single machine scheduling with polyhedral uncertainty
• A robust two-machine flow-shop scheduling model with scenario-dependent processing times
• Investigating the recoverable robust single machine scheduling problem under interval uncertainty
• A robust approach for the single machine scheduling problem
• Algorithms and complexity analysis for robust single-machine scheduling problems

This page was built for publication: A family of inequalities valid for the robust single machine scheduling polyhedron

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2270446)