Simple heuristics for scheduling with limited intermediate storage
From MaRDI portal
Publication:868994
DOI10.1016/j.cor.2005.09.004zbMath1144.90404MaRDI QIDQ868994
Publication date: 26 February 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.09.004
90B36: Stochastic scheduling theory in operations research
Related Items
Cites Work
- Unnamed Item
- Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
- Heuristics for multimode scheduling problems with dedicated resources
- Resource-constrained project scheduling. Exact methods for the multi-mode case
- A genetic algorithm for flowshop sequencing
- Flow-shop problems with intermediate buffers
- A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
- Project scheduling with inventory constraints
- Project scheduling under limited resources. Models, methods, and applications
- Benchmarks for basic scheduling problems
- Optimal two- and three-stage production schedules with setup times included
- Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
- Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects
- Flowshop sequencing problems with limited buffer storage
- An Adaptable Scheduling Algorithm for Flexible Flow Lines
- Flowshop scheduling with limited temporary storage
- Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
- Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage
- Note—Sequencing with Finite Intermediate Storage
- Ordonnancements à contraintes disjonctives
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
