Minimizing number of tardy jobs on a batch processing machine with incompatible job families

DOI10.1016/j.ejor.2003.10.011zbMath1132.90326OpenAlexW2137903142MaRDI QIDQ707142

Fariborz Jolai

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

zbMATH Keywords

Dynamic programmingSchedulingBatch processing machineNumber of tardy jobs criteria

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (14)

A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes ⋮ 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 ⋮ An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities ⋮ Batch machine production with perishability time windows and limited batch size ⋮ On the complexity of bi-criteria scheduling on a single batch processing machine ⋮ A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes ⋮ Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes ⋮ Makespan minimization on single batch-processing machine via ant colony optimization ⋮ Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness ⋮ Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes ⋮ Controlling job arrivals with processing time windows into batch processor buffer ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ Single-machine batch scheduling with job processing time compatibility

Cites Work

• Efficient scheduling algorithms for a single batch processing machine
• Scheduling a batching machine
• 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
• Minimizing total completion time on a batch processing machine with job families
• Batching and Scheduling Jobs on Batch and Discrete Processors
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
• Scheduling a single batch processing machine with non-identical job sizes
• Scheduling batch processing machines with incompatible job families
• Reducibility among Combinatorial Problems
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

This page was built for publication: Minimizing number of tardy jobs on a batch processing machine with incompatible job families