A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach
From MaRDI portal
Publication:1699353
DOI10.1007/s40314-015-0302-8zbMath1384.90044OpenAlexW2226422592MaRDI QIDQ1699353
Ghasem Moslehi, Saeed Emami, Mohammad S. Sabbagh
Publication date: 23 February 2018
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-015-0302-8
robust optimizationorder acceptance and schedulingBenders decomposition algorithmnon-identical parallel machines
Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times ⋮ Benders decomposition for a period-aggregated resource leveling problem with variable job duration ⋮ Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling ⋮ Accelerating Benders decomposition: multiple cuts via multiple solutions ⋮ Exact methods for order acceptance and scheduling on unrelated parallel machines ⋮ A robust location-arc routing problem under uncertainty: mathematical model with lower and upper bounds ⋮ A matheuristic for the generalized order acceptance and scheduling problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch and price solution approach for order acceptance and capacity planning in make-to-order operations
- Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
- Large-scale mixed integer programming: Benders-type heuristics
- Order acceptance with weighted tardiness
- A comparative analysis of several asymmetric traveling salesman problem formulations
- Order acceptance using genetic algorithms
- Partitioning procedures for solving mixed-variables programming problems
- Multi-period job selection: Planning work loads to maximize profit
- Job selection in a heavily loaded shop
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- Robust solutions of linear programming problems contaminated with uncertain data
- Order acceptance and scheduling with machine availability constraints
- Recent advances in robust optimization: an overview
- Speed-up Benders decomposition using maximum density cut (MDC) generation
- Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach
- An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions
- Selecting jobs for heavily loaded shop with lateness penalties
- Accelerating Benders Decomposition by Local Branching
- Accelerating Benders method using covering cut bundle generation
- Linear programming with interval right hand sides
- The Price of Robustness
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- Robust Solutions to Uncertain Semidefinite Programs
- Inexact Cuts in Benders Decomposition
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
