Batch machine production with perishability time windows and limited batch size
From MaRDI portal
Publication:631099
DOI10.1016/J.EJOR.2010.10.033zbMATH Open1207.90053OpenAlexW1976186261MaRDI QIDQ631099FDOQ631099
Authors: Konstantin Chakhlevitch, Hans Kellerer, C. A. Glass
Publication date: 22 March 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.10.033
Recommendations
Cites Work
- Scheduling with batching: A review
- Scheduling a batching machine
- On scheduling an unbounded batch machine
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Efficient scheduling algorithms for a single batch processing machine
- Batching identical jobs
- On the Complexity of Scheduling with Batch Setup Times
- Scheduling batch processing machines with incompatible job families
- Minimizing number of tardy jobs on a batch processing machine with incompatible job families
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
- Scheduling with agreeable release times and due dates on a batch processing machine
- The Batch Loading and Scheduling Problem
- Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times
- Scheduling with batching: Minimizing the weighted number of tardy jobs
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
- Title not available (Why is that?)
- The data broadcast problem with non-uniform transmission times
- Improved approximation algorithms for broadcast scheduling
- Title not available (Why is that?)
Cited In (6)
- Integrated production and delivery scheduling with disjoint windows
- Product selection, machine time allocation, and scheduling decisions for manufacturing perishable products subject to a deadline
- Minimising the number of gap-zeros in binary matrices
- Parallel machine problems with equal processing times: a survey
- Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties
- Single-machine batch scheduling with job processing time compatibility
This page was built for publication: Batch machine production with perishability time windows and limited batch size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q631099)