Scheduling an unbounded batching machine with job processing time compatibilities
From MaRDI portal
Publication:765334
DOI10.1016/J.DAM.2011.09.004zbMATH Open1238.90060OpenAlexW1985129003MaRDI QIDQ765334FDOQ765334
Authors: Adam Janiak, A. Bellanger, M. Y. Kovalyov, A. 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
Recommendations
- scientific article; zbMATH DE number 6402512
- On scheduling an unbounded batch machine
- Scheduling an Unbounded Batch Machine to Minimize Maximum Lateness
- Scheduling problems on parallel identical unbounded batch processing machines
- Scheduling on a batch machine with job compatibilities
- Scheduling a batch processing machine with non-identical job sizes
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
- Single-machine batch scheduling with job processing time compatibility
- Scheduling unrelated parallel batch processing machines with non-identical job sizes
- Batch scheduling on uniform machines to minimize total flow-time
Cites Work
- Title not available (Why is that?)
- Scheduling with batching: A review
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Scheduling a batching machine
- On scheduling an unbounded batch machine
- Efficient algorithms for interval graphs and circular-arc graphs
- Approximation algorithms in batch processing
- 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
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- Single machine parallel-batch scheduling with deteriorating jobs
- Scheduling a batch processing machine with bipartite compatibility graphs
- Batch processing with interval graph compatibilities between tasks
- Single machine parallel batch scheduling subject to precedence constraints
- Scheduling on a batch machine with job compatibilities
- Minimizing mean completion time in a batch processing system
- Scheduling hybrid flowshop with parallel batching machines and compatibilities
- Flowshop scheduling problem with a batching machine and task compatibilities
Cited In (10)
- Batch scheduling on uniform machines to minimize total flow-time
- On scheduling an unbounded batch machine
- An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities
- Integrated scheduling problem on a single bounded batch machine with an unavailability constraint
- Optimal methods for batch processing problem with makespan and maximum lateness objectives
- Busy time scheduling on a bounded number of machines (extended abstract)
- Stochastic scheduling of a batch processing machine with incompatible job families
- Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs
- Scheduling on a batch processing machine with split compatibility graphs
- Single-machine batch scheduling with job processing time compatibility
This page was built for publication: Scheduling an unbounded batching machine with job processing time compatibilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765334)
