Concepedia

Single machine scheduling problems with financial resource constraints: Some complexity results and properties

Evgeny R. Gafarov, A. A. Lazarev, Frank Werner

Mathematical Social Sciences · 2011 · 58 citations · 9 references

DOI

Concepts

References

9

Minimizing Total Tardiness on One Machine is NP-Hard

Jianzhong Du, Joseph Y.‐T. Leung · Mathematics of Operations Research · 1990 · 735 citations

, , +12

A decomposition algorithm for the single machine total tardiness problem

Chris N. Potts, L. N. Van Wassenhove · Operations Research Letters · 1982 · 302 citations

, , +11

Solution of the single machine total tardiness problem

Włodzimierz Szwarc, Federico Della Croce, Andrea Grosso · Journal of Scheduling · 1999 · 54 citations

, , +12

Scheduling subject to nonrenewable-resource constraints

Jacques Carlier, A. H. G. Rinnooy Kan · Operations Research Letters · 1982 · 48 citations

, , +12

Preemptive scheduling of independent jobs on parallel machines subject to financial constraints

Roman Słowiński · European Journal of Operational Research · 1984 · 47 citations

, , +13