Semi-online scheduling on two identical machines with a common due date to maximize total early work

Bounds for Certain Multiprocessing Anomalies

Ronald Graham · Bell System Technical Journal · 1966 · 1.6K citations

Computing, Computer Engineering, Computer Science +14

When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

Gerhard J. Woeginger · INFORMS journal on computing · 2000 · 232 citations

Natural Sciences, Computer Science, Mathematics +16

Semi on-line algorithms for the partition problem

Hans Kellerer, M. Grazia Speranza, Źsolt Tuza · Operations Research Letters · 1997 · 178 citations

Computing, Computer Science, Algorithms +7

Semi On-Line Scheduling on Two Identical Machines

Yong He, Guochuan Zhang · Computing · 1999 · 149 citations

Management, Computer Science, Industrial Engineering +4

Single Machine Scheduling to Minimize Total Late Work

Chris N. Potts, Luk N. Van Wassenhove · Operations Research · 1992 · 136 citations

Computing, Computer Science, Algorithms +9