Flow shop scheduling with multiple objective of minimizing makespan and total flow time

This paper deals with the multicriterion approach to flow shop scheduling [FSS] problems by considering makespan time and total flow time. The primary concern of flow shop scheduling is to obtain the best sequence, which minimizes the makespan, flow time, idle time, tardiness, etc. In this work, mak...

Full description

Saved in:
Bibliographic Details
Published in:International journal of advanced manufacturing technology 2005-05, Vol.25 (9-10), p.1007-1012
Main Authors: Ravindran, D., Selvakumar, S.J., Sivaraman, R., Haq, A. Noorul
Format: Article
Language:English
Subjects:
Algorithms
Job shop scheduling
Job shops
Multiple objective analysis
Production scheduling
Search algorithms
Sequential scheduling
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper deals with the multicriterion approach to flow shop scheduling [FSS] problems by considering makespan time and total flow time. The primary concern of flow shop scheduling is to obtain the best sequence, which minimizes the makespan, flow time, idle time, tardiness, etc. In this work, makespan and total flow time of the jobs are considered for minimization. Three heuristic algorithms namely HAMC1, HAMC2 and HAMC3 have been proposed in this paper. The effectiveness of the heuristics has been analyzed using the problems generated by Taillard [16]. The results of the problems are compared with the solution procedures proposed by Rajendran [15]. The new hybrid algorithms are developed by taking the seed sequences yielded by a method proposed by Rajendran [14] in his work to minimize flow time and improving it using search algorithm. The hybrid algorithm gives better results.
ISSN:0268-3768
1433-3015
DOI:10.1007/s00170-003-1926-1