PofoliaShared via Pofolia

Journal of Scheduling· 2026Q1

Theoretical lower bounds for a parallel batch scheduling problem

Marie-Louise Lackner, Francesca Da Ros, Nysret Musliu

Short summary

New, quickly computable, problem-specific lower bounds are developed for the NP-hard Oven Scheduling Problem (OSP) in semiconductor manufacturing.

AI-generated from the title and abstract; the full text is not read.

Key points

  • Developed novel, problem-specific theoretical lower bounds for the Oven Scheduling Problem (OSP).
  • These lower bounds are designed for very fast computation.
  • Evaluated the quality and improvement potential of the new bounds on existing solution methods.
  • The bounds aid in assessing solution quality for large OSP instances where exact methods are insufficient.

AI-generated from the title and abstract; the full text is not read.

Abstract

Abstract The Oven Scheduling Problem (OSP) is an NP-hard real-world parallel batch scheduling problem arising in the semiconductor industry. Its objective is to schedule a set of jobs on ovens while minimizing 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. 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 capability to improve existing solution methods. 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.

The authors' abstract, as published at the source. Journal of Scheduling, 2026 · DOI ↗

TakeawaysPremium
Ask the paperFree account

Continue with a free account

Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.

Continue free on the web

Sign in with Google or Apple; no card needed. You come back to this paper.

On your phone:

Field: Industrial and Manufacturing Engineering

Industrial and Manufacturing EngineeringEngineering