Relocation problems of maximizing new capacities under a common due date

DOI10.1080/00207729208949397zbMath0850.93072OpenAlexW2149912165MaRDI QIDQ4020638

Shian-Shyong Tseng, Miao-Tsong Lin

Publication date: 17 January 1993

Published in: International Journal of Systems Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Related Items

On the relocation problem with a second working crew for resource recycling ⋮ Generating the best \(K\) sequences in relocation problems ⋮ Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints

Cites Work

• A fast feasibility test for relocation problems
• Optimal two- and three-stage production schedules with setup times included
• Relocation problems are hard
• Some results of the relocation problems with processing times and deadlines