EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-ND 3.0

Permutation, no-wait, no-idle flow shop problems

Mariusz Makuchowski

Archives of Control Sciences · 2015

DOI: 10.1515/acsc-2015-0012 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Archives of Control Sciences, 2015. Verfasst von Mariusz Makuchowski. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 5 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 3.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The paper compares the schedules of different variants of the flow shop problem, i.e. permutation, no waiting and no idle flow shop problems. It is assessed the impact of the constraints on the extension of the schedules and correlations of the length of the schedules for these variants. It is also examined the effectiveness of a set of insert type algorithms. The efficiency of the algorithms is tested on well-known literature benchmarks.

Zitieren

APA

Makuchowski, M. (2015). Permutation, no-wait, no-idle flow shop problems. Archives of Control Sciences. https://doi.org/10.1515/acsc-2015-0012

Vancouver

Makuchowski M. Permutation, no-wait, no-idle flow shop problems. Archives of Control Sciences. 2015. doi:10.1515/acsc-2015-0012

BibTeX
@article{Makuchowski2015,
  author = {Makuchowski, Mariusz},
  title = {Permutation, no-wait, no-idle flow shop problems},
  journal = {Archives of Control Sciences},
  year = {2015},
  doi = {10.1515/acsc-2015-0012}
}
Kostenlos starten →