Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling

DOI10.1016/j.ejor.2019.10.014zbMath1443.90188OpenAlexW2980649523WikidataQ127017626 ScholiaQ127017626MaRDI QIDQ2189876

Bahman Naderi, Vahid Roshanaei

Publication date: 17 June 2020

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2019.10.014

zbMATH Keywords

combinatorial optimizationBenders decompositionmixed-integer programmingorder acceptance identical parallel machine schedulingtemporary cuts

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (12)

Minimizing maximum delivery completion time for order scheduling with rejection ⋮ Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times ⋮ Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition ⋮ Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem ⋮ Branch-and-check approaches for the tourist trip design problem with rich constraints ⋮ On the mass COVID-19 vaccination scheduling problem ⋮ Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date ⋮ Unrelated parallel machine scheduling problem with special controllable processing times and setups ⋮ Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut ⋮ Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut ⋮ A matheuristic for the generalized order acceptance and scheduling problem ⋮ Order assignment and scheduling under processing and distribution time uncertainty

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
• Order acceptance with weighted tardiness
• A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
• Partitioning procedures for solving mixed-variables programming problems
• Job selection in a heavily loaded shop
• Logic-based Benders decomposition
• A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach
• The Benders decomposition algorithm: a literature review
• Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling
• Metaheuristics for a scheduling problem with rejection and tardiness penalties
• A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
• Selecting jobs for heavily loaded shop with lateness penalties
• Decomposition Methods for the Parallel Machine Scheduling Problem with Setups
• Logic-Based Decomposition Methods for the Travelling Purchaser Problem
• Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem
• Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty
• Planning and Scheduling by Logic-Based Benders Decomposition
• Collaborative Operating Room Planning and Scheduling

This page was built for publication: Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling