A zero-one (0-1) linear programming formulation of multiproject and job-shop scheduling problems is presented that is more general and computationally tractable than other known formulations. It can ...

View on Coursera Course Description This course continues our data structures and algorithms specialization by focussing on the use of linear and integer programming formulations for solving ...

F. Brian Talbot, Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case, Management Science, Vol. 28, No. 10 (Oct., 1982), pp ...