Pages that link to "Item:Q2968494"

The following pages link to A lexicographic approach to the robust resource-constrained project scheduling problem (Q2968494):

Displaying 9 items.

• Bi-objective resource-constrained project scheduling with robustness and makespan criteria (Q850236) (← links)
• A computational study of exact approaches for the adjustable robust resource-constrained project scheduling problem (Q1654362) (← links)
• Exact lexicographic scheduling and approximate rescheduling (Q2029366) (← links)
• An updated survey of variants and extensions of the resource-constrained project scheduling problem (Q2242185) (← links)
• A compact reformulation of the two-stage robust resource-constrained project scheduling problem (Q2668660) (← links)
• THE LEXICO-BOUNDED FLOW ALGORITHM FOR SOLVING THE MINIMUM COST PROJECT SCHEDULING PROBLEM WITH AN ADDITIONAL LINEAR CONSTRAINT (Q3220333) (← links)
• Robust Buffer Allocation for Scheduling of a Project with Predefined Milestones (Q4931918) (← links)
• Multi‐mode resource‐constrained project scheduling using modified variable neighborhood search heuristic (Q6088236) (← links)
• The contractor time–cost–credit trade‐off problem: integer programming model, heuristic solution, and business insights (Q6090500) (← links)