Decomposition methods for the parallel machine scheduling problem with setups
From MaRDI portal
Publication:2806866
Recommendations
- Logic-based Benders decomposition for alternative resource scheduling with sequence dependent setups
- Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines
- Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times
- Solving Parallel Machine Scheduling Problems by Column Generation
- Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals
Cites work
- scientific article; zbMATH DE number 2084694 (Why is no real title available?)
- A Hybrid Algorithm for a Class of Resource Constrained Scheduling Problems
- A constraint programming approach for solving a queueing design and control problem
- A hybrid method for the planning and scheduling
- A tabu search algorithm to minimize the makespan for the unrelated parallel machines scheduling problem with setup times
- Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
- Heuristic and exact algorithms for a min-max selective vehicle routing problem
- Logic-based Benders decomposition
- Logic-based Benders decomposition for alternative resource scheduling with sequence dependent setups
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Partitioning procedures for solving mixed-variables programming problems
- Planning and Scheduling by Logic-Based Benders Decomposition
- Routing a heterogeneous fleet of vehicles
- SCIP: solving constraint integer programs
- Scheduling a Dynamic Aircraft Repair Shop with Limited Repair Resources
- Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan
- Textile Production Systems: a Succession of Non-identical Parallel Processor Shops
- Unrelated parallel machine scheduling using local search
- Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem
Cited in
(27)- Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem
- Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect
- Integrated optimization of material supplying, manufacturing, and product distribution: models and fast algorithms
- Logic-based Benders decomposition for large-scale optimization
- Novel formulations and logic-based Benders decomposition for the integrated parallel machine scheduling and location problem
- A fix-and-optimize heuristic for the unrelated parallel machine scheduling problem
- A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions
- Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling
- A branch and price algorithm for single-machine completion time variance
- Order assignment and scheduling under processing and distribution time uncertainty
- Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines
- Efficient algorithms for flexible job shop scheduling with parallel machines
- Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling
- Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling
- Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut
- Collaborative operating room planning and scheduling
- A Benders decomposition approach for a real case supply chain network design with capacity acquisition and transporter planning: wheat distribution network
- Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times
- Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals
- Unrelated parallel machine scheduling problem with special controllable processing times and setups
- Identical parallel machine scheduling with assurance of maximum waiting time for an emergency job
- Exact methods for order acceptance and scheduling on unrelated parallel machines
- Scheduling with divisible jobs and subcontracting option
- Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut
- Logic-based Benders decomposition for alternative resource scheduling with sequence dependent setups
- Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems
- Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times
This page was built for publication: Decomposition methods for the parallel machine scheduling problem with setups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806866)
