Abstract
In provious studies [2], [6], [7], [8] , the sequencing problem in a flowshop was considered as a problem of minimizing the make-span of jobs that consist of a singl item. This consideration has been reflected to the model with one condition ; Even though, the job lot production is done in flowshops where the machines are arranged serially, no job may be processed in more than one machine at the same time. I the job lot shop, an overlap is feasible through the operations of the same job on adjacent machines. If job lot size is enough and/or transportation is available, th schedule with an overlap will have a shorter make-span than one without an overlap. Maximum allowable overlap [1] , is calculated by using operation times,“start lag” and “stop lag”.
This paper is a summary of a part of Dr.KIRAN’s Ph.D.Dissertation (Ref [3]) under Prof.Dr.Eng.I.I.KARAYAçIN.
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
HOLLOWAY, C.A.— NELSON, R.T.,“Job Shop Scheduling with Due Dates and Operation Overlap Feasibility”, AIIE Transactions 7, No.1 (1975).
JOHNSON, S.M.,“Optimal Two-and Three-Stage Production Schedules with Setup Times Included”, Nav. Res. Log. Quart. 1, 61–69 (1954)
KIRAN, AŞ.,“New Models and Algorithms for the Flow Shop Scheduling Problem” in Turkish, Ph.D. Dissertation, ITÜ. (1977)
MITTEN, L.G.,“A Scheduling Problem“, The J. of Ind. Eng. 10, No.2 (1959)
MITTEN, L.G.,“Sequencing n Jobs on Two Machines with Arbitrary Time Lags”, Man. Sci. 5, No.3 (1959)
SZWARC, W.,“Elimination Methods in the mxn Sequencing Problem”, Nav.Res. Log. Quart. 18, 295–305 (1971)
SZWARC, W.,“Mathematical Aspects of 3xn Job Shop Sequencing Problem”, Nay. Res. Log. Quart. 21, 145–153 (1974) and 725–726 (1974)
SMITH, R.D. — DUDEK, R.A.,“A General Algorithm for Solution of the n-Job, Machine Sequencing Problem of Flow Shop“, Opns. Res. 15, 71–82 (1967) and“Errata”
SMITH, R.D. — DUDEK, R.A.,“A General Algorithm for Solution of the n-Job, Machine Sequencing Problem of Flow Shop“, Opns.Res. 17, 756 (1969).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1978 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karayalçin, I.I., Kiran, A.S. (1978). A New Model and Algorithms for Flow-Shop Scheduling with Overlap Feasibility. In: Brockhoff, K., Dinkelbach, W., Kall, P., Pressmar, D.B., Spicher, K. (eds) Vorträge der Jahrestagung 1977 / Papers of the Annual Meeting 1977 DGOR. Proceedings in Operations Research 7, vol 1977. Physica, Heidelberg. https://doi.org/10.1007/978-3-662-00409-8_40
Download citation
DOI: https://doi.org/10.1007/978-3-662-00409-8_40
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-0194-1
Online ISBN: 978-3-662-00409-8
eBook Packages: Springer Book Archive