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

Hamid Abedinnia, C. H. Glock and A Brill

Publications of Darmstadt Technical University, Institute for Business Studies (BWL) from Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL)

Date: 2016-03-24
Note: for complete metadata visit http://tubiblio.ulb.tu-darmstadt.de/79712/
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Published in Computers & Operations Research (2016-03-24) : pp. 165-174

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S030505481630079X

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:dar:wpaper:79712

Access Statistics for this paper

More papers in Publications of Darmstadt Technical University, Institute for Business Studies (BWL) from Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL) Contact information at EDIRC.
Bibliographic data for series maintained by Dekanatssekretariat ().