Shwimer, Joel On the N-job, one-machine, sequence-independent scheduling problem with tardiness penalties: A branch-bound solution. (English) Zbl 0231.90030 Manage. Sci., Appl. 18, B301-B313 (1972). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 13 Documents MSC: 90C10 Integer programming 90B35 Deterministic scheduling theory in operations research 49M30 Other numerical methods in calculus of variations (MSC2010) PDFBibTeX XMLCite \textit{J. Shwimer}, Manage. Sci., Appl. 18, B301--B313 (1972; Zbl 0231.90030) Full Text: DOI