Minimizing number of tardy jobs on a batch processing machine with incompatible job families
From MaRDI portal
Publication:707142
DOI10.1016/J.EJOR.2003.10.011zbMATH Open1132.90326OpenAlexW2137903142MaRDI QIDQ707142FDOQ707142
Publication date: 9 February 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2003.10.011
Recommendations
- Scheduling batch processing machines with incompatible job families
- Scheduling jobs on a single batch processing machine with incompatible job families and weighted number of tardy jobs objective
- Scheduling jobs with agreeable processing times and due dates on a single batch processing machine
- Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families
- Minimizing total completion time on a batch processing machine with job families
Cites Work
- Reducibility among Combinatorial Problems
- Scheduling a batching machine
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Efficient scheduling algorithms for a single batch processing machine
- Scheduling a single batch processing machine with non-identical job sizes
- Scheduling batch processing machines with incompatible job families
- Minimizing total completion time on a batch processing machine with job families
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
- Scheduling with agreeable release times and due dates on a batch processing machine
- Papers presented at the workshop on discrete algorithms, University of Osnabrück, Germany, July 10-12, 1991
Cited In (15)
- Modelling and analysis of a multi-stage system involving batch processors with incompatible job families
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
- On the complexity of bi-criteria scheduling on a single batch processing machine
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
- Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
- An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
- Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
- Batch machine production with perishability time windows and limited batch size
- Makespan minimization on single batch-processing machine via ant colony optimization
- Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- A survey of scheduling with parallel batch (p-batch) processing
- Controlling job arrivals with processing time windows into batch processor buffer
- Single-machine batch scheduling with job processing time compatibility
This page was built for publication: Minimizing number of tardy jobs on a batch processing machine with incompatible job families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q707142)
