Batch-size-based rearrangement of the shop floor into mini-lines
From MaRDI portal
Publication:2967580
DOI10.1080/00207543.2010.518990zbMATH Open1356.90054OpenAlexW2147964239MaRDI QIDQ2967580FDOQ2967580
Authors:
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
Recommendations
Cites Work
- Scheduling with batching: A review
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimizing makespan with multiple-orders-per-job in a two-machine flowshop
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Scheduling batches on parallel machines with major and minor set-ups
- Scheduling a single batch processing machine with non-identical job sizes
- A taxonomy of flexible flow line scheduling procedures
- An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint
- An Adaptable Scheduling Algorithm for Flexible Flow Lines
- Conceptual framework for lot-sizing and scheduling of flexible flow lines
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
- The Line Segmentation Problem
- Two-machine flowshop scheduling with job class setups to minimize total flowtime
Uses Software
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)
