A time-indexed formulation for single-machine scheduling problems : column generation
暂无分享,去创建一个
[1] Martin W. P. Savelsbergh,et al. A Branch-and-Price Algorithm for the Generalized Assignment Problem , 1997, Oper. Res..
[2] J. M. van den Akker,et al. LP-based solution methods for single-machine scheduling problems , 1994 .
[3] Frits C. R. Spieksma,et al. Scheduling jobs of equal length: complexity, facets and computational results , 1995, Math. Program..
[4] J. Sousa,et al. Time Indexed Formulations Of Non-Preemptive Single-Machine Schduling Problems , 1989 .
[5] Martin W. P. Savelsbergh,et al. A Time-Indexed Formulation for Single-Machine Scheduling Problems: Branch-and-Cut , 1996 .
[6] van den Jm Marjan Akker,et al. Facet inducing inequalities for single-machine scheduling problems , 1993 .
[7] Laurence A. Wolsey,et al. A time indexed formulation of non-preemptive single machine scheduling problems , 1992, Math. Program..
[8] David K. Smith. Theory of Linear and Integer Programming , 1987 .