Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem

DOI10.1016/j.cor.2023.106156OpenAlexW4283214184MaRDI QIDQ6164353

Carla Juvin, Laurent Houssin, Pierre Lopez

Publication date: 4 July 2023

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

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

zbMATH Keywords

Benders decompositionconstraint programmingmixed-integer programmingpreemptionflexible job-shop scheduling

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• An optimal method for the preemptive job shop scheduling problem
• Properties of optimal schedules in preemptive shop scheduling
• Integrated methods for optimization.
• Mathematical models for job-shop scheduling problems with routing and process plan flexibility
• The one-machine sequencing problem
• Resource constraints for preemptive job-shop scheduling
• Preemptive job-shop scheduling problems with a fixed number of jobs
• Tabu search for the job-shop scheduling problem with multi-purpose machines
• An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
• Logic-based Benders decomposition
• Solving the flexible job shop scheduling problem with sequence-dependent setup times
• The preemptive stochastic resource-constrained project scheduling problem
• Mathematical models for preemptive shop scheduling problems
• Deterministic job-shop scheduling: Past, present and future
• Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
• Routing and scheduling in a flexible job shop by tabu search
• A genetic algorithm for the flexible job-shop scheduling problem
• On the mass COVID-19 vaccination scheduling problem
• Decomposition Methods for the Parallel Machine Scheduling Problem with Setups
• A research survey: review of flexible job shop scheduling techniques
• Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem
• Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
• Combinatorial Benders' Cuts for the Strip Packing Problem
• Planning and Scheduling by Logic-Based Benders Decomposition
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• An Algorithm for Solving the Job-Shop Problem
• A Computational Study of the Job-Shop Scheduling Problem
• The Complexity of Flowshop and Jobshop Scheduling
• The Schedule-Sequencing Problem
• Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
• Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem
• APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS