Time-Indexed Formulations for Machine Scheduling Problems: Column Generation

References

• Van Den Akker J.M., Van Hoesel C.P.M., Savelsbergh M.W.P. A Polyhedral Approach to Single-Machine Scheduling Problems. Mathematical Programming (1999) 85:541–572Crossref, Google Scholar
• Van Den Akker J.M.LP-Based Solution Methods for Single-Machine Scheduling Problems (1994) (Eindhoven University of Technology, Eindhoven, The Netherlands) . Ph.D. ThesisGoogle Scholar
• Beloudah H., Posner M.E., Potts C.N. Scheduling with Release Dates on a Single Machine to Minimize Total Weighted Completion Time. Discrete Applied Mathematics (1992) 36:213–231Crossref, Google Scholar
• Crama Y., Spieksma F.C.R. Scheduling Jobs of Equal Length: Complexity and Facets. Mathematical Programming (1996) 72:207–227Crossref, Google Scholar
• Dyer M.E., Wolsey L.A. Formulating the Single Machine Sequencing Problem with Release Dates as a Mixed Integer Program. Discrete Applied Mathematics (1990) 26:255–270Crossref, Google Scholar
• Goemans M.X. Improved Approximation Algorithms for Scheduling with Release Dates. Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (1997) 591–598Google Scholar
• Hall L.A., Schulz A.S., Shmoys D.B., Wein J. Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms. Mathematics of Operations Research (1997) 22:513–544Link, Google Scholar
• Lasdon L.S.Optimization Theory for Large Systems (1970) (Mac-Millan, New York) Google Scholar
• Lee Y., Sherali H.D. Unrelated Machine Scheduling with Time-Window and Machine Downtime Constraints: An Application to a Naval Battle-Group Problem. Annals of Operations Research (1994) 50:339–365Crossref, Google Scholar
• Phillips C., Stein C., Wein J. Minimizing Average Completion Time in the Presence of Release Dates. Mathematical Programming (1998) 82:199–223Crossref, Google Scholar
• Queyranne M., Schulz A.S.Polyhedral Approaches to Machine Scheduling (1994) (Department of Mathematics, Technical University of Berlin, Berlin) . Preprint 408/1994, Revised in October 1996Google Scholar
• Savelsbergh M.W.P. A Branch-and-Price Algorithm for the Generalized Assignment Problem. Operations Research (1997) 45:831–841Link, Google Scholar
• Savelsbergh M.W.P., Uma R.N., Wein J. An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems. Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (1998) 453–462Google Scholar
• Schrijver A.Theory of Linear and Integer Programming (1986) (Wiley, New York) Google Scholar
• Sherali H.D., Lee Y., Boyer D.D. Scheduling Target Illuminators in Naval Battle-Group Anti-Air Warfare. Naval Research Logistics (1995) 42:737–755Crossref, Google Scholar
• De Sousa J.P.Time-indexed formulations of non-preemptive single-machine scheduling problems (1989) (Catholic University of Louvain, Louvain-la-Neuve, Belgium) . Ph.D. ThesisGoogle Scholar
• De Sousa J.P., Wolsey L.A. A Time-Indexed Formulation of Non-Preemptive Single-Machine Scheduling Problems. Mathematical Programming (1992) 54:353–367Crossref, Google Scholar
• Vanderbeck F., Wolsey L.A. An Exact Algorithm for IP Column Generation. Operations Research Letters (1996) 19:151–160Crossref, Google Scholar