Relocation problems of maximizing new capacities under a common due date

DOI10.1080/00207729208949397MaRDI QIDQ4020638zbMATH OpenOpenAlexFDO

Authors Miao-Tsong Lin, Shian-Shyong Tseng

Publication date 17 January 1993

Published in International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cites work

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

Cited in

(3)

• 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
• On the relocation problem with a second working crew for resource recycling

This page was built for publication: Relocation problems of maximizing new capacities under a common due date

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4020638)