Skip to main content
Conference Proceedings

Flow Shop Problem with Machine Time Couplings

Advances in Intelligent Systems and Computing (2020) 987 80-89
DOI: 10.1007/978-3-030-19501-4_8
3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The work presents a multi-machine flow shop problem with minimization of the completion time of all tasks. Different temporal couplings concerning machine operation have been proposed, resulting from the analysis of practical cases. Their mathematical models were presented, an exact algorithm and two approximate algorithms were implemented.

Author supplied keywords

Cite

CITATION STYLE

APA

Bożejko, W., Idzikowski, R., & Wodecki, M. (2020). Flow Shop Problem with Machine Time Couplings. In Advances in Intelligent Systems and Computing (Vol. 987, pp. 80–89). Springer Verlag. https://doi.org/10.1007/978-3-030-19501-4_8

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