Discrete parallel machine makespan ScheLoc problem
type: Item
instance of: scholarly article
title: Discrete parallel machine makespan ScheLoc problem
zbMATH Open document ID: 1383.90013
author: Corinna Heßler
author: Kaouthar Deghdak
published in: Journal of Combinatorial Optimization
publication date: 2017-11-09T00:00:00Z
full work available at URL: http://nbn-resolving.de/urn/resolver.pl
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 6804422
zbMATH Keywords: scheduling location
zbMATH Keywords: discrete location
zbMATH Keywords: integrated problems
MaRDI profile type: Publication
OpenAlex ID: W2596144614
cites work: Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem
cites work: Bounds for Certain Multiprocessing Anomalies
cites work: Q3511520
cites work: Q5714326
cites work: Q4605683
cites work: Solving scheduling and location problems in the plane simultaneously
cites work: The \(p\)-median problem: a survey of metaheuristic approaches
cites work: Location Theory
cites work: Solution methods for thep-median problem: An annotated bibliography
cites work: State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
DOI: 10.1007/S10878-017-0138-9
Recommended article: Exact makespan minimization of unrelated parallel machines
Recommended article: Problem of parallel machines with polymatroidal constraints
Recommended article: Minimizing the makespan in nonpreemptive parallel machine scheduling problem
Recommended article: Minimizing Makespan on Parallel Machines with Machine Eligibility Restrictions
Recommended article: Parallel machine scheduling problems with a single server
Recommended article: Q5426358
Recommended article: Parallel machine makespan minimization subject to machine availability and total completion time constraints
Recommended article: Scheduling problem with multi-purpose parallel machines
Recommended article: Q3491300
Recommended article: Parallel solutions for preemptive makespan scheduling on two identical machines
description: scientific article; zbMATH DE number 6804422