Computing redundant resources for the resource constrained project scheduling problem
暂无分享,去创建一个
[1] Jeffrey D. Ullman,et al. Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..
[2] Armin Scholl,et al. Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling , 1999, Eur. J. Oper. Res..
[3] P. Brucker,et al. Tabu Search Algorithms and Lower Bounds for the Resource-Constrained Project Scheduling Problem , 1999 .
[4] Jacques Carlier,et al. On linear lower bounds for the resource constrained project scheduling problem , 2003, Eur. J. Oper. Res..
[5] Peter Brucker,et al. Lower bounds for resource-constrained project scheduling problems , 2003, Eur. J. Oper. Res..
[6] Jacek Blazewicz,et al. Scheduling under resource constraints - deterministic models , 1986 .
[7] Rainer Kolisch,et al. Characterization and generation of a general class of resource-constrained project scheduling problems , 1995 .
[8] Sándor P. Fekete,et al. New Classes of Lower Bounds for Bin Packing Problems , 1998, IPCO.
[9] Silvano Martello,et al. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .
[10] Rolf H. Möhring,et al. Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems , 1999, ESA.
[11] J. Erschler,et al. Ordonnancement de tâches sous contraintes: une approche énergetique , 1992 .
[12] Philippe Baptiste,et al. Tight LP bounds for resource constrained project scheduling , 2004, OR Spectr..
[13] Abdelkader Lahrichi,et al. Ordonnancements. La notion de «parties obligatoires» et son application aux problèmes cumulatifs , 1982 .
[14] Paolo Toth,et al. Lower bounds and reduction procedures for the bin packing problem , 1990, Discret. Appl. Math..
[15] Erik Demeulemeester,et al. New Benchmark Results for the Resource-Constrained Project Scheduling Problem , 1997 .
[16] George L. Nemhauser,et al. Handbooks in operations research and management science , 1989 .
[17] Eugene L. Lawler,et al. Sequencing and scheduling: algorithms and complexity , 1989 .
[18] V. Maniezzo,et al. An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation , 1998 .
[19] Christian Artigues,et al. Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem , 2005, INFORMS J. Comput..
[20] Philippe Baptiste,et al. Satisfiability tests and time‐bound adjustmentsfor cumulative scheduling problems , 1999, Ann. Oper. Res..
[21] Jacques Carlier,et al. A new LP-based lower bound for the cumulative scheduling problem , 2000, Eur. J. Oper. Res..
[22] Peter Brucker,et al. A linear programming and constraint propagation-based lower bound for the RCPSP , 2000, Eur. J. Oper. Res..