Scheduling with step-improving processing times

DOI10.1016/j.orl.2005.03.002zbMath1080.90044OpenAlexW1997838169MaRDI QIDQ2583705

Yong He, Min Ji, Hoogeveen, J. A., Gerhard J. Woeginger, Cheng, T. C. Edwin

Publication date: 18 January 2006

Published in: Operations Research Letters (Search for Journal in Brave)

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

zbMATH Keywords

schedulingapproximation schemeKnapsack problemcompetitive analysis.

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (1)

A review of four decades of time-dependent scheduling: main results, new topics, and open problems

Cites Work

• Unnamed Item
• A concise survey of scheduling with time-dependent processing times

This page was built for publication: Scheduling with step-improving processing times