Open-shop batch scheduling with identical jobs
From MaRDI portal
Publication:2467272
DOI10.1016/J.EJOR.2006.03.068zbMATH Open1137.90511OpenAlexW2071726958MaRDI QIDQ2467272FDOQ2467272
Publication date: 21 January 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.03.068
Cites Work
- Scheduling with batching: A review
- A survey of scheduling problems with setup times or costs
- Batching in single operation manufacturing systems
- Computational Complexity of Discrete Optimization Problems
- Minimizing flow-time on a single machine with integer batch sizes
- A polynomial algorithm for a one machine batching problem
- A note on flow-shop and job-shop batch scheduling with identical processing-time jobs
- Scheduling batches with sequential job processing for two-machine flow and open shops
- Flow-shop batch scheduling with identical processing-time jobs
- Two-machine shop scheduling problems with batch processing
Cited In (16)
- The just-in-time scheduling problem in a flow-shop scheduling system
- Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times
- Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
- Single machine scheduling with two competing agents and equal job processing times
- Family scheduling with batch availability in flow shops to minimize makespan
- A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints
- Batch scheduling on two-machine flowshop with machine-dependent setup times
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- Two-machine open shop problem with a single server and set-up time considerations
- A survey of scheduling problems with setup times or costs
- Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system
- A note on batch scheduling on a two-machine flowshop with machine-dependent processing times
- Batch scheduling on a two-machine jobshop with machine-dependent setup times
- Iterated greedy algorithms for a complex parallel machine scheduling problem
- A polynomial-time algorithm for a flow-shop batching problem with equal-length operations
- Scheduling with centralized and decentralized batching policies in concurrent open shops
This page was built for publication: Open-shop batch scheduling with identical jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467272)
