Heuristics Resolution of a Constrained Hybrid Flow Shop Problem
暂无分享,去创建一个
[1] T. B. Tate,et al. Machine Scheduling Problems , 1978 .
[2] Rainer Leisten,et al. Flowshop sequencing problems with limited buffer storage , 1990 .
[3] M. Solomon,et al. Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time , 1996 .
[4] A. Kan. Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .
[5] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .
[6] D. S. Palmer. Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .
[7] Jean-Charles Billaut,et al. Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art , 1999, RAIRO Oper. Res..
[8] David G. Dannenbring,et al. An Evaluation of Flow Shop Sequencing Heuristics , 1977 .