A note on batch scheduling on a two-machine flowshop with machine-dependent processing times
From MaRDI portal
Publication:6054015
DOI10.1007/s10288-022-00519-zzbMath1525.90217OpenAlexW4288444188MaRDI QIDQ6054015
Publication date: 24 October 2023
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-022-00519-z
Cites Work
- Unnamed Item
- Single machine batch scheduling with two competing agents to minimize total flowtime
- Batch scheduling on two-machine flowshop with machine-dependent setup times
- Single machine scheduling with batch-dependent setup times
- Bicriterion scheduling with equal processing times on a batch processing machine
- Batching and scheduling in a multi-machine flow shop
- Batching in single operation manufacturing systems
- One-pass batching algorithms for the one-machine problem
- A polynomial algorithm for a one machine batching problem
- Batching identical jobs
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
- Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
- A note on flow-shop and job-shop batch scheduling with identical processing-time jobs
- A single machine batch scheduling problem with bounded batch size
- Open-shop batch scheduling with identical jobs
- Minimizing flow-time on a single machine with integer batch sizes
- Batch scheduling on a two-machine jobshop with machine-dependent setup times
- Batching to Minimize Flow Times on One Machine
- Flow-shop batch scheduling with identical processing-time jobs
- Optimal Scheduling of Products with Two Subassemblies on a Single Machine
- Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow
