Computing redundant resources for the resource constrained project scheduling problem-Reference-Cited by-同舟云学术

Computing redundant resources for the resource constrained project scheduling problem

Published:2007-02 Issue:3 Volume:176 Page:1452-1463
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Carlier Jacques,Néron Emmanuel

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference20 articles.

1. S. Demassey, C. Artigues, P. Michelon, A hybrid constraint propagation cutting plane procedure for the RCPSP, in: Proc. CPAIOR, 2002.

2. Tabu search algorithms and lower bounds for the resource-constrained project scheduling problem;Baar,1998

3. Satisfiability tests and time bound adjustments for cumulative scheduling problems;Baptiste;Annals of Operations Research,1999

4. Tight LP bounds for resource constrained project scheduling;Baptiste;OR Spectrum,2004

5. Scheduling under resource constraints – deterministic models;Blazewicz;Annals of Operations Research,1986

Cited by 26 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Evaluating the Effect of Redundant Resources on Corporate Entrepreneurial Performance;Sustainability;2022-06-09

2. Element Matching and Configuration Path of Corporate Social Responsibility Performance;Sustainability;2022-05-28

3. Symmetry breaking of identical projects in the high-multiplicity RCPSP/max;Journal of the Operational Research Society;2019-04-23

4. A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem;RAIRO - Operations Research;2018-04

5. Redundant cumulative constraints to compute preemptive bounds;Discrete Applied Mathematics;2018-01