Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds
From MaRDI portal
Publication:2845031
DOI10.1051/ro/2013025zbMath1282.90065OpenAlexW2118257511MaRDI QIDQ2845031
Publication date: 22 August 2013
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/495d6dad79589e3f54cc3e8b1c840423b971e710
Related Items (2)
A binary multiple knapsack model for single machine scheduling with machine unavailability ⋮ Minimizing the weighted number of tardy jobs on a single machine: strongly correlated instances
This page was built for publication: Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds