Optimization of Makespan in Job and Machine Priority Environment
暂无分享,去创建一个
[1] David G. Dannenbring,et al. An Evaluation of Flow Shop Sequencing Heuristics , 1977 .
[2] Shikharesh Majumdar,et al. Heuristic algorithms for priority assignment in flow shops , 1998, 1998 IEEE International Performance, Computing and Communications Conference. Proceedings (Cat. No.98CH36191).
[3] A Baskar,et al. A Simple Model to Optimize General Flow-Shop Scheduling Problems With Known Break Down Time And Weights Of Jobs , 2012 .
[4] Jatinder N. D. Gupta,et al. A Functional Heuristic Algorithm for the Flowshop Scheduling Problem , 1971 .
[5] A. B. Chandramouli,et al. Heuristic Approach for N-Job, 3-Machine Flow Shop Scheduling Problem Involving Transportation Time, Break Down Time and Weights of Jobs , 2005 .
[6] A. Baskar,et al. Solving Permutation Flow Shop Scheduling Problems with Job Idle Time in between Two Machines , 2012 .
[7] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .
[8] P. Rajendran,et al. Solving Constrained Flow-Shop Scheduling Problems with Three Machines , 2010 .
[9] D. S. Palmer. Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .
[10] R. A. Dudek,et al. A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .
[11] P. Chang,et al. The development of gradual-priority weighting approach for the multi-objective flowshop scheduling problem , 2002 .