Resource-constrained flowshop scheduling with separate resource recycling operations

DOI10.1016/j.cor.2010.07.015zbMath1251.90124MaRDI QIDQ1762095

Bertrand M. T. Lin, Hsiao-Lan Huang, Cheng, T. C. Edwin

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.07.015

zbMATH Keywords

complexity; flowshop scheduling; resource constraint; relocation problem; recycling operations

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90B35: Deterministic scheduling theory in operations research

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On relocation problems with multiple identical working crews
• Minimizing the total weighted completion time in the relocation problem
• Johnson's rule, composite jobs and the relocation problem
• Scheduling subject to resource constraints: Classification and complexity
• A fast feasibility test for relocation problems
• Polynomial algorithms for single machine scheduling problems with financial constraints
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Optimal two- and three-stage production schedules with setup times included
• Relocation problems are hard
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• On the relocation problem with a second working crew for resource recycling