Tight complexity analysis of the relocation problem with arbitrary release dates
type: Item
instance of: scholarly article
title: Tight complexity analysis of the relocation problem with arbitrary release dates
zbMATH Open document ID: 1230.90100
author: B. M. T. Lin
author: Hsiao-Lan Huang
author: Sergey Sevastyanov
published in: Theoretical Computer Science
publication date: 2011-09-12T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 5947152
zbMATH Keywords: relocation problem
zbMATH Keywords: resource constraints
zbMATH Keywords: release dates
zbMATH Keywords: makespan
zbMATH Keywords: NP-hardness
zbMATH Keywords: multi-parametric dynamic programming
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.04.034
OpenAlex ID: W2094901897
cites work: Scheduling subject to resource constraints: Classification and complexity
cites work: Resource-constrained project scheduling: Notation, classification, models, and methods
cites work: Johnson's rule, composite jobs and the relocation problem
cites work: Q4198056
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Q3821925
cites work: Resource-constrained project scheduling: A survey of recent developments.
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: On relocation problems with multiple identical working crews
cites work: Minimizing the total weighted completion time in the relocation problem
cites work: An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
cites work: Planning and Scheduling in Manufacturing and Services
cites work: Polynomial algorithms for single machine scheduling problems with financial constraints
DOI: 10.1016/J.TCS.2011.04.034
description: scientific article; zbMATH DE number 5947152