Talbot, F. Brian; Patterson, James H. An efficient integer programmig algorithm with network cuts for solving resource-constrained scheduling problems. (English) Zbl 0395.90036 Manage. Sci. 24, 1163-1174 (1978). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 2 ReviewsCited in 54 Documents MSC: 90B35 Deterministic scheduling theory in operations research 90C90 Applications of mathematical programming 90C10 Integer programming 90C35 Programming involving graphs or networks 90B30 Production models 05C30 Enumeration in graph theory Keywords:Network Cuts; Integer Programmig Algorithm; Resource-Constrained Scheduling Problems; Implicit Enumeration; Computational; Efficiency PDFBibTeX XMLCite \textit{F. B. Talbot} and \textit{J. H. Patterson}, Manage. Sci. 24, 1163--1174 (1978; Zbl 0395.90036) Full Text: DOI