TU Darmstadt / ULB / TUbiblio

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

Abedinnia, Hamid ; Glock, C. H. ; Brill, A (2016)
New Simple Constructive Heuristic Algorithms for Minimizing Total Flow-Time in the Permutation Flowshop Scheduling Problem.
In: Computers & Operations Research, 74
Article, Bibliographie

Item Type: Article
Erschienen: 2016
Creators: Abedinnia, Hamid ; Glock, C. H. ; Brill, A
Type of entry: Bibliographie
Title: New Simple Constructive Heuristic Algorithms for Minimizing Total Flow-Time in the Permutation Flowshop Scheduling Problem
Language: English
Date: 24 March 2016
Journal or Publication Title: Computers & Operations Research
Volume of the journal: 74
URL / URN: http://www.sciencedirect.com/science/article/pii/S0305054816...
Divisions: 01 Department of Law and Economics
01 Department of Law and Economics > Betriebswirtschaftliche Fachgebiete
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
Date Deposited: 30 Mar 2016 12:14
Last Modified: 20 May 2021 12:33
PPN:
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)
Show editorial Details Show editorial Details