Abstract
As noted in Chapter 4.2, the operations scheduling problem (OSP) with machine independent quadratic interaction costs is identical with the graph partitioning problem (GPP). We compare in this chapter these alternative formulations for the OSP in this special case. By comparing the two formulations we do not mean an empirical comparison, but rather an analytical comparison such as the one carried out by Padberg and Sung [1991] for four different formulations of the traveling salesman problem. This guarantees that our results have validity for any numerical calculations based on the formulations that we propose in Chapters 4.2 and 4.3. In the second half of this chapter we derive some results on the facial structure of the OSP.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Padberg, M., Rijal, M.P. (1996). Quadratic Scheduling Problems. In: Location, Scheduling, Design and Integer Programming. International Series in Operations Research & Management Science, vol 3. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1379-3_6
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1379-3_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8596-0
Online ISBN: 978-1-4613-1379-3
eBook Packages: Springer Book Archive