A simple linear time algorithm for scheduling with step-improving processing times

DOI10.1016/j.cor.2005.09.011zbMath1144.90382OpenAlexW2006162128MaRDI QIDQ869002

Min Ji, Cheng, T. C. Edwin, Yong He

Publication date: 26 February 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10397/653

zbMATH Keywords

schedulingapproximation algorithmworst-case ratio

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• A concise survey of scheduling with time-dependent processing times
• An Algorithm for Large Zero-One Knapsack Problems

This page was built for publication: A simple linear time algorithm for scheduling with step-improving processing times