Heuristic scheduling of jobs on a multi-product batch processing machine

DOI10.1080/00207549608905019zbMath0946.90535OpenAlexW2010137231MaRDI QIDQ4230214

Maria Pia Fanti, G. Piscitelli, B. Maione, Biagio Turchiano

Publication date: 1 March 1999

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207549608905019

Mathematics Subject Classification ID

Production models (90B30)

Related Items (10)

Minimizing total weighted tardiness on a single batch process machine with incompatible job families ⋮ Setup coordination between two stages of a production system: a multi-objective evolutionary approach ⋮ Performance evaluation of due-date based dispatching rules in dynamic scheduling of diffusion furnace ⋮ Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling ⋮ Just-in-time single-batch-processing machine scheduling ⋮ Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families ⋮ Makespan minimization on single batch-processing machine via ant colony optimization ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ A new dynamic look-ahead scheduling procedure for batching machines ⋮ Genetic multi-criteria approach to flexible line scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient scheduling algorithms for a single batch processing machine
• The complexity of one-machine batching problems
• 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
• Scheduling a single batch processing machine with non-identical job sizes

This page was built for publication: Heuristic scheduling of jobs on a multi-product batch processing machine