Ten notes on equal-processing-time scheduling - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles 4OR: A Quarterly Journal of Operations Research Year : 2004

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.
No file

Dates and versions

inria-00124157 , version 1 (12-01-2007)

Identifiers

  • HAL Id : inria-00124157 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More