Flexible job shop scheduling with blockages
From MaRDI portal
Publication:2454071
DOI10.1007/s00186-013-0456-3zbMath1401.90074OpenAlexW2087201864MaRDI QIDQ2454071
R. S. Hansmann, Uwe T. Zimmermann, T. Rieger
Publication date: 12 June 2014
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-013-0456-3
Related Items
Uses Software
Cites Work
- Unnamed Item
- The flexible blocking job shop with transfer and set-up times
- Optimal scheduling of a two-stage hybrid flow shop
- A taxonomy of flexible flow line scheduling procedures
- A memetic algorithm for the flexible flow line scheduling problem with processor blocking
- Discrepancy search for the flexible job shop scheduling problem
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
- The hybrid flow shop scheduling problem
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS
- Scheduling