An exact framework for the discrete parallel machine scheduling location problem

DOI10.1016/j.cor.2021.105318OpenAlexW3155629222MaRDI QIDQ2668759

Arthur Kramer, Raphael Kramer

Publication date: 7 March 2022

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

Full work available at URL: https://arxiv.org/abs/2006.08327

zbMATH Keywords

heuristicsschedulingmakespanfacility locationexact framework

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
• Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates
• Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
• Deterministic global optimization. Geometric branch-and-bound methods and their applications
• Solving scheduling and location problems in the plane simultaneously
• A time indexed formulation of non-preemptive single machine scheduling problems
• Exact solution of bin-packing problems using column generation and branch-and-bound
• Discrete parallel machine makespan ScheLoc problem
• Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
• A gamma heuristic for the \(p\)-median problem
• LP models for bin packing and cutting stock problems
• Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem
• Robust absolute single machine makespan scheduling-location problem on trees
• Novel formulations and modeling enhancements for the dynamic berth allocation problem
• Planning and Scheduling in Manufacturing and Services
• Mathematical Models and Search Algorithms for the Capacitated p-Center Problem
• The Meet-in-the-Middle Principle for Cutting and Packing Problems
• Location Science
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Scheduling

This page was built for publication: An exact framework for the discrete parallel machine scheduling location problem