Theoretical Lower Bounds for the Oven Scheduling Problem
<|reference_start|>Theoretical Lower Bounds for the Oven Scheduling Problem: The Oven Scheduling Problem (OSP) is an NP-hard real-world parallel batch scheduling problem arising in the semiconductor industry. The objective of the problem is to schedule a set of jobs on ovens while minimizing several factors, namely total oven runtime, job tardiness, and setup costs. At the same time, it must adhere to various constraints such as oven eligibility and availability, job release dates, setup times between batches, and oven capacity limitations. The key to obtaining efficient schedules is to process compatible jobs simultaneously in batches. In this paper, we develop theoretical, problem-specific lower bounds for the OSP that can be computed very quickly. We thoroughly examine these lower bounds, evaluating their quality and exploring their integration into existing solution methods. Specifically, we investigate their contribution to exact methods and a metaheuristic local search approach using simulated annealing. Moreover, these problem-specific lower bounds enable us to assess the solution quality for large instances for which exact methods often fail to provide tight lower bounds.<|reference_end|>
@article{da ros2024theoretical,
    title={Theoretical Lower Bounds for the Oven Scheduling Problem},
    author={Francesca Da Ros and Marie-Louise Lackner and Nysret Musliu},
    journal={Proceedings of the 14th International Conference on the Practice
  and Theory of Automated Timetabling, 2024},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.01368},
    primaryClass={cs.AI cs.DC cs.DS}
}