Decomposition Methods for the Parallel Machine Scheduling Problem with Setups
From MaRDI portal
Publication:2806866
DOI10.1287/ijoc.2015.0666zbMath1338.90184OpenAlexW2255734301MaRDI QIDQ2806866
Tony T. Tran, Arthur Araújo, J. Christopher Beck
Publication date: 19 May 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a7e0eef543804b3278740413fe8cc69e33111a02
Related Items
Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times, Scheduling with divisible jobs and subcontracting option, Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem, Identical parallel machine scheduling with assurance of maximum waiting time for an emergency job, Unrelated parallel machine scheduling problem with special controllable processing times and setups, Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times, Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling, Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems, Efficient algorithms for flexible job shop scheduling with parallel machines, Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut, A Benders decomposition approach for a real case supply chain network design with capacity acquisition and transporter planning: wheat distribution network, Collaborative Operating Room Planning and Scheduling, Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem, Exact methods for order acceptance and scheduling on unrelated parallel machines, Logic-Based Benders Decomposition for Large-Scale Optimization, Integrated optimization of material supplying, manufacturing, and product distribution: models and fast algorithms, Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling, A branch and price algorithm for single-machine completion time variance, Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut, Order assignment and scheduling under processing and distribution time uncertainty, Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Heuristic and exact algorithms for a min-max selective vehicle routing problem
- SCIP: solving constraint integer programs
- A hybrid method for the planning and scheduling
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
- Partitioning procedures for solving mixed-variables programming problems
- Unrelated parallel machine scheduling using local search
- Logic-based Benders decomposition
- Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan
- Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem
- A Constraint Programming Approach for Solving a Queueing Design and Control Problem
- Textile Production Systems: a Succession of Non-identical Parallel Processor Shops
- Planning and Scheduling by Logic-Based Benders Decomposition
- Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation
- Routing a Heterogeneous Fleet of Vehicles
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling a Dynamic Aircraft Repair Shop with Limited Repair Resources
- A Hybrid Algorithm for a Class of Resource Constrained Scheduling Problems
