TU Darmstadt / ULB / TUbiblio

New Simple Constructive Heuristic Algorithms for Minimizing Total Flow-Time in the Permutation Flowshop Scheduling Problem

Abedinnia, Hamid and Glock, C. H. and Brill, A (2016):
New Simple Constructive Heuristic Algorithms for Minimizing Total Flow-Time in the Permutation Flowshop Scheduling Problem.
In: Computers & Operations Research, pp. 165-174, 74, [Online-Edition: http://www.sciencedirect.com/science/article/pii/S0305054816...],
[Article]

Item Type: Article
Erschienen: 2016
Creators: Abedinnia, Hamid and Glock, C. H. and Brill, A
Title: New Simple Constructive Heuristic Algorithms for Minimizing Total Flow-Time in the Permutation Flowshop Scheduling Problem
Language: English
Journal or Publication Title: Computers & Operations Research
Volume: 74
Divisions: 01 Department of Law and Economics
01 Department of Law and Economics > Betriebswirtschaftliche Fachgebiete > Fachgebiet Produktion und Supply Chain Management
01 Department of Law and Economics > Betriebswirtschaftliche Fachgebiete > Fachgebiet Industrielles Management
01 Department of Law and Economics > Betriebswirtschaftliche Fachgebiete
Date Deposited: 30 Mar 2016 12:14
Official URL: http://www.sciencedirect.com/science/article/pii/S0305054816...
Export:
Suche nach Titel in: TUfind oder in Google

Optionen (nur für Redakteure)

View Item View Item