Abstract
In this study, the job shop scheduling problem is analysed with respect to numerous objectives, and a multi-objective model is developed to optimise the makespan, maximum job earliness, maximum job tardiness, maximum machine idle time, total machine idling penalties, total job untimed penalties, and total penalties (multi-objective) using the genetic algorithm.
Publisher
Granthaalayah Publications and Printers
Reference38 articles.
1. S. French, "Sequencing and scheduling," An Introduction to the Mathematics of the Job-Shop, 1982.
2. J. Sridhar and C. Rajendran, "Scheduling in flowshop and cellular manufacturing systems with multiple objectives—a genetic algorithmic approach," Production Planning & Control, vol. 7, pp. 374-382, 1996.
3. B. Yagmahan and M. M. Yenisey, "A multi-objective ant colony system algorithm for flow shop scheduling problem," Expert Systems with Applications, vol. 37, pp. 1361-1368, 2010.
4. S. M. Johnson, "Optimal two‐and three‐stage production schedules with setup times included," Naval research logistics quarterly, vol. 1, pp. 61-68, 1954.
5. V. R. Neppalli, C.-L. Chen, and J. N. Gupta, "Genetic algorithms for the two-stage bicriteria flowshop problem," European journal of operational research, vol. 95, pp. 356-373, 1996.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献