|
|
A Set of Algorithms for Solving the Generalized Tardiness Flowshop Problems
|
|
|
|
|
نویسنده
|
Ghassemi-Tari Farhad ,Olfat Laya
|
منبع
|
journal of industrial and systems engineering - 2010 - دوره : 4 - شماره : 3 - صفحه:156 -166
|
چکیده
|
This paper considers the problem of scheduling n jobs in the generalized tardiness flow shopproblem with m machines. seven algorithms are developed for finding a schedule withminimum total tardiness of jobs in the generalized flow shop problem. two simple rules, theshortest processing time (spt), and the earliest due date (edd) sequencing rules, are modifiedand employed as the core of sequencing determination for developing these seven algorithms.we then evaluated the effectiveness of the modified rules through an extensive computationalexperiment.
|
کلیدواژه
|
Flowshop ,Total tardiness ,Intermediate due dates
|
آدرس
|
sharif university of technology, Department of Industrial Engineering, Sharif University of Technology, ایران, allameh tabataba-i university, School of Management, Alameh-Tabatabie University, ایران
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|