Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs

Introduction to Algorithms

V. J. Rayward‐Smith, Thomas H. Cormen, Charles E. Leiserson et al. · Journal of the Operational Research Society · 1991 · 16.9K citations

Network Flows: Theory, Algorithms, and Applications.

David K. Smith, Ravindra K. Ahuja, Thomas L. Magnanti et al. · Journal of the Operational Research Society · 1994 · 8.1K citations · Full text

Network flows: Theory, algorithms and applications

Discrete Applied Mathematics · 1994 · 2.6K citations

Network Flows, Network Science, Engineering +4

Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

Fǎnicǎ Gavril · SIAM Journal on Computing · 1972 · 532 citations

Minimum Coloring, Engineering, Planar Graph +17

Single machine scheduling to minimize the number of early and tardy jobs

Avital Lann, Gur Mosheiov · Computers & Operations Research · 1996 · 106 citations

Job Scheduler, Engineering, Tardy Jobs +10