Minimizing total weighted tardiness on a single batch process machine with incompatible job families

DOI10.1016/S0305-0548(03)00239-9zbMath1073.90015OpenAlexW1963645413MaRDI QIDQ1885945

John W. Fowler, Imelda C. Perez, W. Matthew Carlyle

Publication date: 12 November 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(03)00239-9

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Related Items (9)

Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling ⋮ Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times ⋮ A constraint programming approach for a batch processing problem with non-identical job sizes ⋮ On the complexity of bi-criteria scheduling on a single batch processing machine ⋮ Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility ⋮ A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals ⋮ A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival ⋮ Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times ⋮ A survey of scheduling with parallel batch (p-batch) processing

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling batches on parallel machines with major and minor set-ups
• Efficient scheduling algorithms for a single batch processing machine
• Scheduling with agreeable release times and due dates on a batch processing machine
• Scheduling with batching: Minimizing the weighted number of tardy jobs
• Stochastic scheduling of a batch processing machine with incompatible job families
• Minimizing total completion time on a batch processing machine with job families
• The Batch Loading and Scheduling Problem
• Dominance and Decomposition Heuristics for Single Machine Scheduling
• Batching and Scheduling Jobs on Batch and Discrete Processors
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• On the Complexity of Scheduling with Batch Setup Times
• Heuristic scheduling of jobs on a multi-product batch processing machine
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• Towards a knowledge-based scheduling system for semiconductor testing
• Batching and Scheduling in FMS Hubs: Flow Time Considerations
• Scheduling a single batch processing machine with non-identical job sizes
• Scheduling batch processing machines with incompatible job families

This page was built for publication: Minimizing total weighted tardiness on a single batch process machine with incompatible job families