On relocation problems with multiple identical working crews
type: Item
instance of: scholarly article
title: On relocation problems with multiple identical working crews
zbMATH Open document ID: 1112.90027
published in: Discrete Optimization
publication date: 2007-02-20T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5128394
zbMATH Keywords: public housing project
zbMATH Keywords: job scheduling
zbMATH Keywords: resource constraints
zbMATH Keywords: parallel machines
zbMATH Keywords: NP-hardness
zbMATH Keywords: approximation
author: Alexander Kononov
author: B. M. T. Lin
MaRDI profile type: Publication
full work available at URL: j.disopt.2006.06.003
OpenAlex ID: W1986734030
cites work: Relocation problems are hard
cites work: Scheduling subject to resource constraints: Classification and complexity
cites work: Discrete-Variable Extremum Problems
cites work: Q4198056
cites work: Bin packing can be solved within 1+epsilon in linear time
cites work: Q3821925
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: A fast feasibility test for relocation problems
cites work: Polynomial algorithms for single machine scheduling problems with financial constraints
DOI: 10.1016/J.DISOPT.2006.06.003
description: scientific article; zbMATH DE number 5128394