Improved bounds on relaxations of a parallel machine scheduling problem
From MaRDI portal
Publication:1383802
DOI10.1023/A:1009750913529zbMath0911.90219OpenAlexW1586637507MaRDI QIDQ1383802
David B. Shmoys, Cynthia A. Phillips, Andreas S. Schulz, Joel M. Wein, Clifford Stein
Publication date: 5 May 1999
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009750913529
release datesidentical parallel machinesaverage completion timeoptimal nonpreemptive scheduleoptimal preemptive schedule
Related Items
An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem, On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems, A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting
