Scheduling manufacturing systems with blocking: a Petri net approach
From MaRDI portal
Publication:3055253
DOI10.1080/00207540802225983zbMath1198.90195OpenAlexW2006419869MaRDI QIDQ3055253
Publication date: 7 November 2010
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540802225983
Cites Work
- An effective architecture for learning and evolving flexible job-shop schedules
- FMS scheduling based on timed Petri net model and reactive graph search
- A heuristic to schedule flexible job-shop in a glass factory
- Job-shop scheduling with blocking and no-wait constraints
- Effective neighbourhood functions for the flexible job shop problem
- A multi-period machine assignment problem
- Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
- A Computational Study of the Job-Shop Scheduling Problem
- The Complexity of Flowshop and Jobshop Scheduling
- Minimizing Cycle Time in a Blocking Flowshop
- Scheduling start time dependent jobs to minimize the total weighted completion time
- Lower bounding schemes for flowshops with blocking in-process
- Mathematical modelling and heuristic approaches to operation scheduling problems in an FMS environment
- Deadlock-free scheduling in flexible manufacturing systems using Petri nets
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process