Skip to main content
Springer Nature Link
Log in

Cost – Time Trade Off Models Application to Crashing Flow Shop Scheduling Problems

  • Conference paper
Computational Science and Its Applications - ICCSA 2006 (ICCSA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3982))

Included in the following conference series:

  • 1504 Accesses

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

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. 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)

    Google Scholar 

  2. 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)

    Google Scholar 

  3. Dannenbring, D.G.: An evaluation of flow shop sequencing heuristics. Management Science 23(11), 1174–1182 (1977)

    Article  MATH  Google Scholar 

  4. Gupta, J.N.D.: A functional heuristic algorithm for the flow shop scheduling problem. Operational Research Quarterly 22(1), 39–47 (1971)

    Article  MATH  Google Scholar 

  5. 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)

    Article  Google Scholar 

  6. Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1(1), 61–68 (1954)

    Article  Google Scholar 

  7. 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)

    Article  Google Scholar 

  8. Nowicki, E., Smutnicki, C.: A fast tabu search algorithm for the permutation flow shop problem. European Journal of Operational Research 91, 160–175 (1996)

    Article  MATH  Google Scholar 

  9. 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)

    Article  Google Scholar 

  10. 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)

    Article  MATH  MathSciNet  Google Scholar 

  11. Osman, I.H., Potts, C.N.: Simulated annealing for permutation flow shop scheduling. OMEGA: International Journal of Management Science 17, 551–557 (1989)

    Article  Google Scholar 

  12. 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)

    Article  MathSciNet  Google Scholar 

  13. Rkock, H., Schmidt, G.: Machine aggregation heuristics in shop scheduling. Methods of Operations Research 45, 303–314 (1982)

    Google Scholar 

  14. Taillard, E.: Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research 47, 65–74 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  15. Turner, S., Booth, D.: Comparison of heuristics for flow shop sequencing. OMEGA: International Journal of Management Science 15, 75–78 (1987)

    Article  Google Scholar 

  16. Widmer, M., Hertz, A.: A new heuristic for the flow shop sequencing problem. European Journal of Operational Research 41, 186–193 (1989)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ph.D. student of Industrial Engineering department, Iran University of Science & Technology, Narmak, Tehran, Iran

    Morteza Bagherpour

  2. Department of Industrial Engineering, Iran University of Science & Technology, Narmak, Tehran, Iran

    Siamak Noori & S. Jafar Sadjadi

Authors
  1. Morteza Bagherpour
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Siamak Noori
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. Jafar Sadjadi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina Gavrilova

  2. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  5. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  6. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  7. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  8. School of Information and Communication Engineering, Sungkyunkwan University, Korea

    Hyunseung Choo

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics