Novel formulations and logic-based Benders decomposition for the integrated parallel machine scheduling and location problem
From MaRDI portal
Publication:5086007
Recommendations
- An exact framework for the discrete parallel machine scheduling location problem
- Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date
- Discrete parallel machine makespan ScheLoc problem
- A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions
- Decomposition methods for the parallel machine scheduling problem with setups
Cites work
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 2242479 (Why is no real title available?)
- A combinatorial Benders' decomposition for the lock scheduling problem
- A new Lagrangian relaxation algorithm for scheduling dissimilar parallel machines with release dates
- A survey on scheduling problems with due windows
- A tabu search algorithm for scheduling pharmaceutical packaging operations
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
- An exact branch-and-price algorithm for scheduling rescue units during disaster response
- Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Combinatorial Benders' cuts for the strip packing problem
- Coordination of production and distribution planning
- Decomposition methods for the parallel machine scheduling problem with setups
- Discrete parallel machine makespan ScheLoc problem
- Early/tardy scheduling with sequence dependent setups on uniform parallel machines
- Equipment Selection and Machine Scheduling in General Mail Facilities
- Heuristic and exact algorithms for the identical parallel machine scheduling problem
- Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates
- Integrated methods for optimization.
- Location analysis: a synthesis and survey
- Logic-based Benders decomposition
- Logic-based Benders decomposition for large-scale optimization
- Minimizing makespan on parallel machines subject to release dates and delivery times
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
- Parallel machine scheduling with time dependent processing times
- Partitioning procedures for solving mixed-variables programming problems
- Planning and Scheduling by Logic-Based Benders Decomposition
- Robust absolute single machine makespan scheduling-location problem on trees
- Scheduling identical parallel machines with tooling constraints
- Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan
- Separation algorithms for 0-1 knapsack polytopes
- Sequential versus integrated optimization: production, location, inventory control, and distribution
- Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem
- Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry
- Solving scheduling and location problems in the plane simultaneously
- The Benders decomposition algorithm: a literature review
- The \(p\)-median problem: a survey of metaheuristic approaches
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- The third comprehensive survey on scheduling problems with setup times/costs
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
- Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem
Cited in
(9)- Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem
- Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date
- The exam location problem: mathematical formulations and variants
- Scheduling-location problem with drones
- Logic-based benders decomposition for bi-objective parallel machine selection and job scheduling with release dates and resource consumption
- A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions
- Scheduling in manufacturing with transportation: classification and solution techniques
- New pseudo polynomial algorithms for a partial resource-constrained project scheduling problem
- Dynamic reversible lane optimization in autonomous driving environments: balancing efficiency and safety
This page was built for publication: Novel formulations and logic-based Benders decomposition for the integrated parallel machine scheduling and location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5086007)
