The following pages link to (Q3468865):
Displaying 33 items.
- A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags (Q1869389) (← links)
- How to make OR-results available: A proposal for project scheduling (Q1897419) (← links)
- Mixed-integer linear programming for resource leveling problems (Q1926816) (← links)
- Optimizing the supply chain configuration for make-to-order manufacturing (Q1926828) (← links)
- A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints (Q2029253) (← links)
- Project scheduling with generalized precedence relations: a new method to analyze criticalities and flexibilities (Q2076817) (← links)
- A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem (Q2084041) (← links)
- Improved formulations and new valid inequalities for a hybrid flow shop problem with time-varying resources and chaining time-lag (Q2108105) (← links)
- The sample analysis machine scheduling problem: definition and comparison of exact solving approaches (Q2146991) (← links)
- On the integration of diverging material flows into resource-constrained project scheduling (Q2160494) (← links)
- A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints (Q2197158) (← links)
- Solve-and-robustify (Q2268511) (← links)
- Kapazitätsplanung in Netzwerken. Ein Überblick über neuere Modelle und Verfahren. (Resource-constrained project planning in networks. A survey on new models and methods) (Q2277354) (← links)
- Immediate schedule adjustment and semidefinite relaxation (Q2313755) (← links)
- Integrated truck and workforce scheduling to accelerate the unloading of trucks (Q2424789) (← links)
- Solving RCPSP/max by lazy clause generation (Q2434317) (← links)
- A memetic algorithm for the job-shop with time-lags (Q2468490) (← links)
- A compact reformulation of the two-stage robust resource-constrained project scheduling problem (Q2668660) (← links)
- A lexicographic approach to the robust resource-constrained project scheduling problem (Q2968494) (← links)
- A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time (Q3064043) (← links)
- Resource allocation by means of project networks: Dominance results (Q3113507) (← links)
- Resource allocation by means of project networks: Complexity results (Q3113509) (← links)
- Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time (Q3313600) (← links)
- A new<i>any-order</i>schedule generation scheme for resource-constrained project scheduling (Q3398590) (← links)
- A branch‐and‐bound algorithm for scheduling of new product development projects (Q4921224) (← links)
- Iterative Flattening Search on RCPSP/max Problems: Recent Developments (Q5191409) (← links)
- (Q5688735) (← links)
- A note on the paper ''Resource-constraint project scheduling: Notation, classification, models and methods'' by Bruckner et al (Q5925873) (← links)
- Local search algorithms for a single-machine scheduling problem with positive and negative time-lags (Q5946822) (← links)
- Scheduling with forbidden sets (Q5961611) (← links)
- \(\Gamma\)-robust optimization of project scheduling problems (Q6065662) (← links)
- Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem (Q6572832) (← links)
- Scheduling activities in project network with feeding precedence relations: an earliest start forward recursion algorithm (Q6588475) (← links)
