Modeling job shop scheduling with batches and setup times by timed Petri nets
From MaRDI portal
Publication:2389898
DOI10.1016/j.mcm.2008.03.010zbMath1165.90472MaRDI QIDQ2389898
Publication date: 20 July 2009
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2008.03.010
90B35: Deterministic scheduling theory in operations research
Related Items
The third comprehensive survey on scheduling problems with setup times/costs, A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints
Cites Work
- FMS scheduling based on timed Petri net model and reactive graph search
- A brief survey and synthesis of the roles of time in Petri nets.
- A survey of scheduling problems with setup times or costs
- Petri net based scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Survey of scheduling research involving setup times