Tabu search methods for scheduling a burn-in oven with non-identical job sizes and secondary resource constraints

DOI10.1504/IJOR.2008.016157zbMath1254.90074OpenAlexW2078068513MaRDI QIDQ2427728

Chandra Sen Mazumdar, M. Mathirajan, Ramesh Gopinath, Appa Iyer Sivakumar

Publication date: 27 May 2008

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

Full work available at URL: https://doi.org/10.1504/ijor.2008.016157

zbMATH Keywords

schedulingbatch processing machinetotal completion timeburn-in ovensecondary resource constraintstabu search method

Mathematics Subject Classification ID

Search theory (90B40) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing ⋮ Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times ⋮ A survey of scheduling with parallel batch (p-batch) processing

This page was built for publication: Tabu search methods for scheduling a burn-in oven with non-identical job sizes and secondary resource constraints