Scheduling an unbounded batching machine with job processing time compatibilities
From MaRDI portal
Publication:765334
DOI10.1016/j.dam.2011.09.004zbMath1238.90060OpenAlexW1985129003MaRDI QIDQ765334
Adam Janiak, Mikhail Y. Kovalyov, Adrien Bellanger, Ammar Oulamara
Publication date: 19 March 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.09.004
Related Items (3)
Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs ⋮ An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities ⋮ Single-machine batch scheduling with job processing time compatibility
Cites Work
- Unnamed Item
- Unnamed Item
- Flowshop scheduling problem with a batching machine and task compatibilities
- Scheduling hybrid flowshop with parallel batching machines and compatibilities
- Single machine parallel-batch scheduling with deteriorating jobs
- Scheduling a batching machine
- Approximation algorithms in batch processing
- Scheduling a batch processing machine with bipartite compatibility graphs
- On-line scheduling a batch processing system to minimize total weighted job completion time
- On-line scheduling algorithms for a batch machine with finite capacity
- On scheduling an unbounded batch machine
- Minimizing mean completion time in a batch processing system
- Scheduling with batching: A review
- Batch processing with interval graph compatibilities between tasks
- Efficient algorithms for interval graphs and circular-arc graphs
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Single machine parallel batch scheduling subject to precedence constraints
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
This page was built for publication: Scheduling an unbounded batching machine with job processing time compatibilities
