Skip to Main content Skip to Navigation
Journal articles

Ten notes on equal-processing-time scheduling

Abstract : Fourteen equal-processing-time scheduling problems whose complexity status has been unknown before are shown to be solved in polynomial time by well-known and relatively new techniques. We consider single-machine, parallel-machine, parallel-batch, open-shop, flow-shop, robotic flow-shop and job-shop machine environments.
Document type :
Journal articles
Complete list of metadata
Contributor : Philippe Baptiste <>
Submitted on : Friday, January 12, 2007 - 2:31:08 PM
Last modification on : Thursday, March 5, 2020 - 6:21:27 PM


  • HAL Id : inria-00124157, version 1



Philippe Baptiste, Peter Brucker, Sigrid Knust, Vadim Timkovski. Ten notes on equal-processing-time scheduling. 4OR: A Quarterly Journal of Operations Research, Springer Verlag, 2004, 4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies, pp.111--127. ⟨inria-00124157⟩



Record views