Pages that link to "Item:Q5595978"

The following pages link to Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case (Q5595978):

Displaying 22 items.

• MIP models for resource-constrained project scheduling with flexible resource profiles (Q297247) (← links)
• Tri-directional scheduling scheme: theory and computation (Q655202) (← links)
• Maximising the weighted number of activity execution modes in project planning (Q724006) (← links)
• Network flows and non-guillotine cutting patterns (Q795062) (← links)
• Complexity of the scheduling language RSV (Q815986) (← links)
• An upper bound for the speedup of parallel best-bound branch-and-bound algorithms (Q1072940) (← links)
• Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem (Q1129955) (← links)
• Surrogate duality relaxation for job shop scheduling (Q1171504) (← links)
• A unified formulation of the machine scheduling problem (Q1245650) (← links)
• A comparative study of computational procedures for the resource constrained project scheduling problem (Q1317169) (← links)
• An exact algorithm for project scheduling with multiple modes (Q1372766) (← links)
• Activity nets: A guided tour through some recent developments (Q1388902) (← links)
• Resource-constrained project scheduling: A survey of recent developments. (Q1406618) (← links)
• Theoretical expectation versus practical performance of Jackson's heuristic (Q1665791) (← links)
• Branch and bound algorithms for resource constrained project scheduling problem subject to nonrenewable resources with prescheduled procurement (Q1718808) (← links)
• Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
• Considering project management activities for engineering design groups (Q2226486) (← links)
• A metric approach for scheduling problems with minimizing the maximum penalty (Q2245804) (← 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)
• A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates (Q2482800) (← links)
• An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling (Q5416771) (← links)
• Project scheduling to minimize the makespan under flexible resource profiles and marginal diminishing returns of the resource (Q6065637) (← links)