Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times
From MaRDI portal
Publication:5444602
DOI10.1080/00207540600786665zbMath1128.90404OpenAlexW2087560807MaRDI QIDQ5444602
Publication date: 25 February 2008
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540600786665
Related Items (8)
Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times ⋮ Scheduling parallel-machine batch operations to maximize on-time delivery performance ⋮ Performance evaluation of due-date based dispatching rules in dynamic scheduling of diffusion furnace ⋮ Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling ⋮ Batch machine production with perishability time windows and limited batch size ⋮ 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 ⋮ A survey of scheduling with parallel batch (p-batch) processing
Cites Work
- Batch sizing and job sequencing on a single machine
- Scheduling a batching machine
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
- Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
- Minimizing total weighted tardiness on a single batch process machine with incompatible job families
- A weighted modified due date rule for sequencing to minimize weighted tardiness
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
- Scheduling batch processing machines with incompatible job families
- Scheduling batches with simultaneous job processing for two-machine shop problems
This page was built for publication: Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times
