Johnson's rule, composite jobs and the relocation problem
From MaRDI portal
Publication:1011248
DOI10.1016/j.ejor.2007.11.035zbMath1157.90409OpenAlexW2093914779MaRDI QIDQ1011248
Cheng, T. C. Edwin, Bertrand M. T. Lin
Publication date: 8 April 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10397/660
Related Items (5)
Flow shop non-idle scheduling and resource-constrained scheduling ⋮ Efficient heuristic algorithm for scheduling two-stage hybrid flowshop with sequence-dependent setup times ⋮ Tight complexity analysis of the relocation problem with arbitrary release dates ⋮ Resource-constrained flowshop scheduling with separate resource recycling operations ⋮ Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times
Cites Work
- Unnamed Item
- On relocation problems with multiple identical working crews
- A fast feasibility test for relocation problems
- Non-bottleneck machines in three-machine flow shops
- A note on a due-date assignment on a two-machine flow-shop
- The simple \(F2//C \max\) with forbidden tasks in first or last position: a problem more complex that it seems
- Optimal two- and three-stage production schedules with setup times included
- OPTIMAL SCHEDULE IN A GT-TYPE FLOW-SHOP UNDER SERIES-PARALLEL PRECEDENCE CONSTRAINTS
- TWO-MACHINE SCHEDULING UNDER REQUIRED PRECEDENCE AMONG JOBS
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
This page was built for publication: Johnson's rule, composite jobs and the relocation problem