Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem
From MaRDI portal
Publication:5086007
DOI10.1287/ijoc.2021.1113zbMath1492.90057OpenAlexW4200572948MaRDI QIDQ5086007
Yantong Li, Peng Wu, Leandro Callegari-Coelho, Jean-François Côté
Publication date: 30 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2021.1113
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (5)
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 ⋮ New pseudo polynomial algorithms for a partial resource-constrained project scheduling problem ⋮ Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem ⋮ Dynamic reversible lane optimization in autonomous driving environments: balancing efficiency and safety
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The third comprehensive survey on scheduling problems with setup times/costs
- A combinatorial Benders' decomposition for the lock scheduling problem
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Solving scheduling and location problems in the plane simultaneously
- Integrated methods for optimization.
- The \(p\)-median problem: a survey of metaheuristic approaches
- A tabu search algorithm for scheduling pharmaceutical packaging operations
- Partitioning procedures for solving mixed-variables programming problems
- Early/tardy scheduling with sequence dependent setups on uniform parallel machines
- Coordination of production and distribution planning
- Logic-based Benders decomposition
- Minimizing makespan on parallel machines subject to release dates and delivery times
- Discrete parallel machine makespan ScheLoc problem
- The Benders decomposition algorithm: a literature review
- Scheduling identical parallel machines with tooling constraints
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
- Sequential versus integrated optimization: production, location, inventory control, and distribution
- Location analysis: a synthesis and survey
- Parallel machine scheduling with time dependent processing times
- Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan
- 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
- Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem
- Robust absolute single machine makespan scheduling-location problem on trees
- An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
- A survey on scheduling problems with due windows
- Separation algorithms for 0-1 knapsack polytopes
- Decomposition Methods for the Parallel Machine Scheduling Problem with Setups
- Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem
- Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates
- Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
- Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem
- Combinatorial Benders' Cuts for the Strip Packing Problem
- A new Lagrangian Relaxation Algorithm for scheduling dissimilar parallel machines with release dates
- Logic-Based Benders Decomposition for Large-Scale Optimization
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Planning and Scheduling by Logic-Based Benders Decomposition
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Equipment Selection and Machine Scheduling in General Mail Facilities
- Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry
This page was built for publication: Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem
