2 results
Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds
-
- Journal:
- RAIRO - Operations Research / Volume 47 / Issue 1 / January 2013
- Published online by Cambridge University Press:
- 11 February 2013, pp. 33-46
- Print publication:
- January 2013
-
- Article
- Export citation
An efficient ILP formulation for the single machine scheduling problem
-
- Journal:
- RAIRO - Operations Research / Volume 44 / Issue 1 / January 2010
- Published online by Cambridge University Press:
- 08 February 2010, pp. 61-71
- Print publication:
- January 2010
-
- Article
- Export citation