Relocation problems are hard

DOI10.1080/00207168808803664MaRDI QIDQ3806808zbMATH OpenOpenAlexFDO

Authors Amihood Amir, Edward H. Kaplan

Publication date 1988

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

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

zbMATH Keywords

NP-completepolynomial reductionrelocationscheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25)

Cited in

(10)

• 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
• Resource-constrained flowshop scheduling with separate resource recycling operations
• An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences
• Relocation scheduling subject to fixed processing sequences
• Some results of the relocation problems with processing times and deadlines
• Relocation problems of maximizing new capacities under a common due date
• On the relocation problem with a second working crew for resource recycling
• On relocation problems with multiple identical working crews
• Minimizing the total weighted completion time in the relocation problem

This page was built for publication: Relocation problems are hard

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