Discrete parallel machine makespan ScheLoc problem

DOI10.1007/S10878-017-0138-9zbMath1383.90013OpenAlexW2596144614MaRDI QIDQ1679512

Corinna Heßler, Kaouthar Deghdak

Publication date: 9 November 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hbz:386-kluedo-41297

zbMATH Keywords

discrete locationintegrated problemsscheduling location

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Related Items (4)

Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem ⋮ An exact framework for the discrete parallel machine scheduling location problem ⋮ On the mass COVID-19 vaccination scheduling problem ⋮ 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
• Solving scheduling and location problems in the plane simultaneously
• The \(p\)-median problem: a survey of metaheuristic approaches
• Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem
• Location Theory
• Solution methods for thep-median problem: An annotated bibliography
• State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
• Bounds for Certain Multiprocessing Anomalies

This page was built for publication: Discrete parallel machine makespan ScheLoc problem