Structure of a simple scheduling polyhedron
暂无分享,去创建一个
[1] J. Stoer,et al. Convexity and Optimization in Finite Dimensions I , 1970 .
[2] E. Balas. On the facial structure of scheduling polyhedra , 1985 .
[3] Marc E. Posner,et al. Minimizing Weighted Completion Times with Deadlines , 1985, Oper. Res..
[4] Martin Grötschel,et al. Mathematical Programming The State of the Art, XIth International Symposium on Mathematical Programming, Bonn, Germany, August 23-27, 1982 , 1983, ISMP.
[5] Wayne E. Smith. Various optimizers for single‐stage production , 1956 .
[6] M. Grötschel,et al. New aspects of polyhedral theory , 1982 .
[7] Eugene L. Lawler,et al. Sequencing and scheduling: algorithms and complexity , 1989 .
[8] Martin E. Dyer,et al. Formulating the single machine sequencing problem with release dates as a mixed integer program , 1990, Discret. Appl. Math..
[9] S. Fujishige. Submodular systems and related topics , 1984 .
[10] Maurice Queyranne,et al. Single-Machine Scheduling Polyhedra with Precedence Constraints , 1991, Math. Oper. Res..
[11] Jan Karel Lenstra,et al. Recent developments in deterministic sequencing and scheduling: a survey : (preprint) , 1981 .
[12] Günter Ewald,et al. Geometry: an introduction , 1971 .
[13] A.H.G. Rinnooy Kan,et al. New directions in scheduling theory , 1984 .
[14] J. Picard,et al. Selected Applications of Minimum Cuts in Networks , 1982 .
[15] Jan Karel Lenstra,et al. Scheduling theory since 1981: an annotated bibliography , 1983 .
[16] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[17] Martin Grötschel,et al. Characterizations of adjacency of faces of polyhedra , 1981 .
[18] Andrew Chi-Chih Yao,et al. On the Polyhedral Decision Problem , 1980, SIAM J. Comput..
[19] G. Grätzer. General Lattice Theory , 1978 .
[20] Michael Ben-Or,et al. Lower bounds for algebraic computation trees , 1983, STOC.
[21] S. Bansal. Single machine scheduling to minimize weighted sum of completion times with secondary criterion -- A branch and bound approach , 1980 .
[22] W. R. Pulleyblank,et al. Polyhedral Combinatorics , 1989, ISMP.
[23] E. L. Lawler,et al. Recent Results in the Theory of Machine Scheduling , 1982, ISMP.
[24] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[25] László Lovász,et al. Submodular functions and convexity , 1982, ISMP.