Non-exhaustive family based dispatching heuristics–exploiting variances of processing and set-up times
From MaRDI portal
Publication:3163249
DOI10.1080/00207540902927926zbMath1197.90177OpenAlexW1965597487MaRDI QIDQ3163249
Publication date: 25 October 2010
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540902927926
Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22) Production models (90B30)
Uses Software
Cites Work
- Reexamination of processing time uncertainty
- The significance of reducing setup times/setup costs
- A survey of scheduling problems with setup times or costs
- Group technology in a hybrid flowshop environment: a case study
- Virtual manufacturing cells: A taxonomy of past research and identification of future research issues
- On Pooling in Queueing Networks
- A comparison of exhaustive and non-exhaustive group scheduling heuristics in a manufacturing cell
- Performance evaluation of family-based dispatching in small manufacturing cells
- An evaluation of group scheduling heuristics in a flow-line manufacturing cell
- A newshop-based and predictive scheduling heuristic for cellular manufacturing
- Dynamic job assignment heuristics for multi-server batch operations- A cost based approach
- Family-based scheduling of shops with functional layouts
- A comparison of cellular manufacturing research presumptions with practice
- Scheduling unbalanced cellular manufacturing systems with lot splitting
- Dynamic scheduling of batch servers with compatible product families
- Heuristics and sequence-dependent set-up jobs in flow line cells
- Dynamic scheduling of batch-processing machines with non-identical product sizes
- Family-based dispatching: anticipating future jobs
This page was built for publication: Non-exhaustive family based dispatching heuristics–exploiting variances of processing and set-up times
