Constraint Propagation for Cumulative Scheduling Problems with Precedences: Constraint Propagation for Cumulative Scheduling Problems with Precedences

[1]  Pascal Van Hentenryck,et al.  Edge Finding for Cumulative Scheduling , 2008, INFORMS J. Comput..

[2]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[3]  Philippe Laborie,et al.  Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results , 2003, Artif. Intell..

[4]  Antoine Jouglet,et al.  A new constraint programming approach for the orthogonal packing problem , 2008, Comput. Oper. Res..

[5]  Erwin Pesch,et al.  Constraint propagation techniques for the disjunctive scheduling problem , 2000, Artif. Intell..

[6]  Peter Brucker,et al.  The job-shop problem and immediate selection , 1994, Ann. Oper. Res..

[7]  Ramón Alvarez-Valdés Olaguíbel,et al.  The project scheduling polyhedron: Dimension, facets and lifting theorems , 1993 .

[8]  Pierre Lopez,et al.  On Not-First/Not-Last conditions in disjunctive scheduling , 2000, Eur. J. Oper. Res..

[9]  Pascal Van Hentenryck,et al.  Strong polynomiality of resource constraint propagation , 2007, Discret. Optim..

[10]  Philippe Baptiste,et al.  Satisfiability tests and time‐bound adjustmentsfor cumulative scheduling problems , 1999, Ann. Oper. Res..

[11]  J. Carlier,et al.  Adjustment of heads and tails for the job-shop problem , 1994 .

[12]  Rainer Kolisch,et al.  PSPLIB - A project scheduling problem library: OR Software - ORSEP Operations Research Software Exchange Program , 1997 .

[13]  Rainer Kolisch,et al.  Characterization and generation of a general class of resource-constrained project scheduling problems , 1995 .

[14]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

[15]  Emmanuel Néron,et al.  Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem , 2006, 4OR.