Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
In this work we show that certain classical preemptive shop scheduling problems with integral data satisfy the following integer preemption property: there exists an optimal preemptive schedule where all interruptions and all starting and completion times occur at integral dates. We also give new upper bounds on the minimal number of interruptions for various shop scheduling problems. © 2010 Elsevier B.V. All rights reserved.
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
Da-Ke He, Ashish Jagmohan, et al.
ISIT 2007
Timothy J. Wiltshire, Joseph P. Kirk, et al.
SPIE Advanced Lithography 1998