Flexible job shop scheduling with blockages
From MaRDI portal
Publication:2454071
DOI10.1007/S00186-013-0456-3zbMATH Open1401.90074OpenAlexW2087201864MaRDI QIDQ2454071FDOQ2454071
Authors: R. S. Hansmann, Thomas Rieger, Uwe T. Zimmermann 
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
Recommendations
- The blocking job shop with rail-bound transportation
- The flexible blocking job shop with transfer and set-up times
- Job-shop scheduling with blocking and no-wait constraints
- Approaches to modeling train scheduling problems as job-shop problems with blocking constraints
- scientific article; zbMATH DE number 4074799
Cites Work
- Introduction to algorithms.
- The hybrid flow shop scheduling problem
- Scheduling
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- A taxonomy of flexible flow line scheduling procedures
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
- Optimal scheduling of a two-stage hybrid flow shop
- Discrepancy search for the flexible job shop scheduling problem
- A memetic algorithm for the flexible flow line scheduling problem with processor blocking
- The flexible blocking job shop with transfer and set-up times
- APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS
Cited In (3)
Uses Software
This page was built for publication: Flexible job shop scheduling with blockages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2454071)
