Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
暂无分享,去创建一个
[1] Han Hoogeveen,et al. Short Shop Schedules , 1997, Oper. Res..
[2] Czeslaw Smutnicki,et al. Some results of the worst-case analysis for flow shop scheduling , 1998, Eur. J. Oper. Res..
[3] Eugeniusz Nowicki,et al. Worst-case analysis of an approximation algorithm for flow-shop scheduling , 1989 .
[4] Marc E. Posner,et al. Generating Experimental Data for Computational Testing with Machine Scheduling Applications , 2001, Oper. Res..
[5] Han Hoogeveen,et al. Minimizing total weighted completion time in a proportionate flow shop , 1998 .
[6] Peng Si Ow,et al. Focused Scheduling in Proportionate Flowshops , 1985 .
[7] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .
[8] R. A. Dudek,et al. Flowshop Sequencing Problem with Ordered Processing Time Matrices , 1975 .
[9] S. S. Panwalkar,et al. Flowshop sequencing problem with ordered processing time matrices: A general case , 1976 .
[10] Eugeniusz Nowicki,et al. New Results in the Worst-Case Analysis for Flow-Shop Scheduling , 1993, Discret. Appl. Math..
[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[12] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[13] Han Hoogeveen,et al. The three-machine proportionate flow shop problem with unequal machine speeds , 2003, Oper. Res. Lett..
[14] Teofilo F. Gonzalez,et al. Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..