• Computer Science
  • Published 2010

A SET OF ALGORITHMS FOR SOLVING THE GENERALIZED TARDINESS FLOWSHOP PROBLEMS

@inproceedings{Farhad2010ASO,
  title={A SET OF ALGORITHMS FOR SOLVING THE GENERALIZED TARDINESS FLOWSHOP PROBLEMS},
  author={Ghassemi Tari Farhad and Olfat Laya},
  year={2010}
}
This paper considers the problem of scheduling n jobs in the generalized tardiness flow shop problem with m machines. Seven algorithms are developed for finding a schedule with minimum total tardiness of jobs in the generalized flow shop problem. Two simple rules, the shortest processing time (SPT), and the earliest due date (EDD) sequencing rules, are modified and employed as the core of sequencing determination for developing these seven algorithms. We then evaluated the effectiveness of the… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 14 REFERENCES

Introduction to Sequencing and Scheduling; John Wiley & Sons, Inc.; New York, ISBN 0-471-04555-1

K. R. Baker
  • 1974
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

Development of a set of algorithms for the multi-projects scheduling problems

F. Ghessemi-Tari, L. Olfat
  • Journal of Industrial and Systems Engineering
  • 2007
VIEW 1 EXCERPT

Minimizing total tardiness of orders with reentrant lots in a hybrid flow shop

S. W. Chio, G. C. Lee, Y. D. Kim
  • International Journal of Production Research
  • 2005
VIEW 1 EXCERPT

A branch and bound for a two stage hybrid flow shop scheduling problem minimizing total tardiness

G. C. Lee, Y. D. Kim
  • International Journal of Production Research
  • 2004
VIEW 2 EXCERPTS

Two COVERT based algorithms for solving the generalized flow shop problems

F. Ghessemi-Tari, L. Olfat
  • Proceeding of the 34 International Conference on Computers and Industrial
  • 2004
VIEW 1 EXCERPT