On the relocation problem with a second working crew for resource recycling

DOI10.1080/10611860500411100zbMath1126.90343OpenAlexW2083007324MaRDI QIDQ5426652

Bertrand M. T. Lin, Hsiao-Lan Huang

Publication date: 13 November 2007

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

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

zbMATH Keywords

makespanlower boundNP-hardheuristic algorithmsflowshoprelocation problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Resource-constrained flowshop scheduling with separate resource recycling operations

Cites Work

• Scheduling subject to resource constraints: Classification and complexity
• A fast feasibility test for relocation problems
• Generating the best \(K\) sequences in relocation problems
• Polynomial algorithms for single machine scheduling problems with financial constraints
• Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints
• 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
• Relocation problems of maximizing new capacities under a common due date
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: On the relocation problem with a second working crew for resource recycling