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...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research Vol. 167; no. 3; pp. 772 - 795
Main Authors: Varadharajan, T.K., Rajendran, Chandrasekharan
Format: Journal Article
Language:English
Published: Elsevier B.V 16.12.2005
Elsevier
Series:European Journal of Operational Research
Subjects:
ISSN:0377-2217, 1872-6860
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first