Some results of the relocation problems with processing times and deadlines

DOI10.1080/00207169108803998zbMath0738.68044OpenAlexW2136687547WikidataQ126244724 ScholiaQ126244724MaRDI QIDQ3979692

Miao-Tsong Lin, Shian-Shyong Tseng

Publication date: 26 June 1992

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169108803998

zbMATH Keywords

schedulingNP-completenessdeadlinesrelocation problemprocessing timesproject and people management

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Relocation problems of maximizing new capacities under a common due date ⋮ Error estimates and adaptive finite element methods ⋮ On the relocation problem with a second working crew for resource recycling ⋮ Generating the best \(K\) sequences in relocation problems

Cites Work

• Unnamed Item
• Scheduling subject to resource constraints: Classification and complexity
• A fast feasibility test for relocation problems
• New trends in machine scheduling
• Relocation problems are hard
• Efficiency of a Good But Not Linear Set Union Algorithm
• Two-Processor Scheduling with Start-Times and Deadlines