Batch-size-based rearrangement of the shop floor into mini-lines
From MaRDI portal
Publication:2967580
DOI10.1080/00207543.2010.518990zbMath1356.90054OpenAlexW2147964239MaRDI QIDQ2967580
No author found.
Publication date: 1 March 2017
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207543.2010.518990
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A taxonomy of flexible flow line scheduling procedures
- An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint
- Minimizing makespan with multiple-orders-per-job in a two-machine flowshop
- Scheduling batches on parallel machines with major and minor set-ups
- Two-machine flowshop scheduling with job class setups to minimize total flowtime
- Scheduling with batching: A review
- An Adaptable Scheduling Algorithm for Flexible Flow Lines
- The Line Segmentation Problem
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
- Scheduling a single batch processing machine with non-identical job sizes
- Conceptual framework for lot-sizing and scheduling of flexible flow lines
This page was built for publication: Batch-size-based rearrangement of the shop floor into mini-lines
