No-Wait Scheduling Problems with Batching Machines
From MaRDI portal
Publication:2958672
DOI10.1007/978-1-4614-1123-9_7zbMath1355.90027OpenAlexW2249252598MaRDI QIDQ2958672
Publication date: 3 February 2017
Published in: Just-in-Time Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-1123-9_7
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Batch sizing and job sequencing on a single machine
- Flowshop scheduling problem with a batching machine and task compatibilities
- Scheduling hybrid flowshop with parallel batching machines and compatibilities
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
- Scheduling a batching machine
- The complexity of one-machine batching problems
- Dynamic scheduling on a single batch processing machine with split compatibility graphs
- Minimizing mean completion time in a batch processing system
- Scheduling with batching: A review
- Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling Groups of Jobs on a Single Machine
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Paths, Trees, and Flowers
- Scheduling batches with simultaneous job processing for two-machine shop problems
This page was built for publication: No-Wait Scheduling Problems with Batching Machines
