A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs

In this paper, we consider the problem of permutation flowshop scheduling with the objectives of minimizing the makespan and total flowtime of jobs, and present a Multi-Objective Simulated-annealing Algorithm (MOSA). Two initial sequences are obtained by using simple and fast existing heuristics, su...

Celý popis

Podrobná bibliografia

Vydané v:	European journal of operational research Ročník 167; číslo 3; s. 772 - 795
Hlavní autori:	Varadharajan, T.K., Rajendran, Chandrasekharan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 16.12.2005 Elsevier
Edícia:	European Journal of Operational Research
Predmet:	Flowshop scheduling Makespan Multiple objectives Simulated annealing Total flowtime Multiple objectives Makespan Total flowtime Flowshop scheduling Simulated annealing
ISSN:	0377-2217, 1872-6860
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!