Abstract
This paper treats a problem of optimally scheduling a number of products on a single facility when changeover costs are sequence independent. After some observations, a rather cumbersome, but straightforward, initial formulation is transformed into a zero-one knapsack problem with side constraints, for which an existing algorithm is modified to provide an efficient solution procedure. A numerical example and computational results are included.
This research was partially supported by ONR Contract No. N00014–70-A-0120–0002
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.
References
Aly, A. A., “Algorithms for Three Single Facility Scheduling Problems”, unpublished M.Sc. Thesis, N. C. State University, 1972.
Balas, E., “An Additive Algorithm for Solving Linear Programs with Zero-One Variables”, Operations Research, Vol. 13, pp. 517–545, 1965.
Elmaghraby, S. E., A. Mallik, and H. L. W. Nuttle, “The Scheduling of Lots on a Single Facility”, AIIE Transactions, Vol. 2, pp. 203–213, 1970.
Elmaghraby, S. E., A. Mallik, and H. L. W. Nuttle, “The Scheduling of a Multi-Product Facility”, O.R. Report No. 76, N. C.State University, April, 1972.
Greenberg, H. and R. L. Hegerich, “A Branch Search Algorithm for the Knapsack Problem”, Management Science, Vol. 16, pp. 327–332, 1970.
Hoyte, D. S., “Scheduling Multi-Product Lots on a Single Facility”, unpublished M.Sc. Thesis, N. C.State University, 1971.
Hoyte, D. S., and H. L. W. Nuttle, “The Scheduling of Multi-Product Lots on a Single Facility”, O.R. ReportNo. 74, N. C. State University,Oct., 1971 (also appears in the Proceedings of the 7th Annual Meeting of the Southeastern Chapter of TIMS, Blacksburg, Va., Oct. 1971.)
Kolesar, P. J., “A Branch-and-Bound Algorithm for the Knapsack Problem”, Management Science, Vol. 13, pp. 723–735, 1967.
Taha, H. A., “A Note on the Solution of Specialized Zero-One Problems by Using Balas’ Algorithm”, Technical Report No. 71–8, Department of Industrial Engineering, University of Arkansas, Nov. 1971.
Taha, H. A., “A Balasian-Based Algorithm for Zero-One Polynomial Programming”, Management Science, Vol. 18, pp. 328–343, 1972.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1973 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Nuttle, H.L.W., Aly, A.A. (1973). A Problem in Single Facility Scheduling with Sequence Independent Changeover Costs. In: Elmaghraby, S.E. (eds) Symposium on the Theory of Scheduling and Its Applications. Lecture Notes in Economics and Mathematical Systems, vol 86. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-80784-8_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-80784-8_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06437-4
Online ISBN: 978-3-642-80784-8
eBook Packages: Springer Book Archive