Abstract
Many traditional cost– time trades off models are computationally expensive to use due to the complexity of algorithms especially for large scale problems. We present a new approach to adapt linear programming to solve cost time trade off problems. The proposed approach uses two different modeling flowshop scheduling into a leveled project management network.
The first model minimizes makespan subject to budget limitation and the second model minimizes total cost to determine optimum makespan over production planning horizon.
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.
Similar content being viewed by others
References
Aldowaisan, T., Allahverdi, A.: New heuristics for m-machine no-wait flowshop to minimize total completion time. International journal of management science 32, 345–352 (2004)
Campbell, H.G., Dudek, R.A., Smith, M.L.: A heuristic algorithm for the n-job, m-machine sequencing problem. Management Science 16(B), 630–637 (1970)
Dannenbring, D.G.: An evaluation of flow shop sequencing heuristics. Management Science 23(11), 1174–1182 (1977)
Gupta, J.N.D.: A functional heuristic algorithm for the flow shop scheduling problem. Operational Research Quarterly 22(1), 39–47 (1971)
Ho, J.C., Chang, Y.L.: A new heuristic for the n-job, m-machine flow shop problem. European Journal of Operational Research 52, 194–206 (1990)
Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1(1), 61–68 (1954)
Lomnicki, Z.A.: A branch and bound algorithm for the exact solution of the three-machine scheduling problem. Operational Research Quarterly 16(1), 89–100 (1965)
Nowicki, E., Smutnicki, C.: A fast tabu search algorithm for the permutation flow shop problem. European Journal of Operational Research 91, 160–175 (1996)
Nawaz, M., Enscore Jr, E.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. OMEGA: International Journal of Management Science 11(1), 91–95 (1983)
Ogbu, F.A., Smith, D.K.: The application of the simulated annealing algorithm to the solution of the n/m/Cmax flow shop problem. Computers and Operations Research 17, 243–253 (1990)
Osman, I.H., Potts, C.N.: Simulated annealing for permutation flow shop scheduling. OMEGA: International Journal of Management Science 17, 551–557 (1989)
Palmer, D.S.: Sequencing jobs through a multi-stage process in the minimum total time—a quick method of obtaining a near optimum. Operational Research Quarterly 16(1), 101–107 (1965)
Rkock, H., Schmidt, G.: Machine aggregation heuristics in shop scheduling. Methods of Operations Research 45, 303–314 (1982)
Taillard, E.: Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research 47, 65–74 (1990)
Turner, S., Booth, D.: Comparison of heuristics for flow shop sequencing. OMEGA: International Journal of Management Science 15, 75–78 (1987)
Widmer, M., Hertz, A.: A new heuristic for the flow shop sequencing problem. European Journal of Operational Research 41, 186–193 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bagherpour, M., Noori, S., Sadjadi, S.J. (2006). Cost – Time Trade Off Models Application to Crashing Flow Shop Scheduling Problems. In: Gavrilova, M., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751595_58
Download citation
DOI: https://doi.org/10.1007/11751595_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34075-1
Online ISBN: 978-3-540-34076-8
eBook Packages: Computer ScienceComputer Science (R0)