Cost - Time trade off models application to crashing flow shop scheduling problems

2Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Bagherpour, M., Noori, S., & Sadjadi, S. J. (2006). Cost - Time trade off models application to crashing flow shop scheduling problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3982 LNCS, pp. 546–553). Springer Verlag. https://doi.org/10.1007/11751595_58

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free