Batch-size-based rearrangement of the shop floor into mini-lines
From MaRDI portal
Publication:2967580
Recommendations
Cites work
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 867338 (Why is no real title available?)
- A taxonomy of flexible flow line scheduling procedures
- An Adaptable Scheduling Algorithm for Flexible Flow Lines
- An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Conceptual framework for lot-sizing and scheduling of flexible flow lines
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Minimizing makespan with multiple-orders-per-job in a two-machine flowshop
- Scheduling a single batch processing machine with non-identical job sizes
- Scheduling batches on parallel machines with major and minor set-ups
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
- Scheduling with batching: A review
- The Line Segmentation Problem
- Two-machine flowshop scheduling with job class setups to minimize total flowtime
This page was built for publication: Batch-size-based rearrangement of the shop floor into mini-lines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2967580)
