Pages that link to "Item:Q880528"

The following pages link to On the complexity of adjacent resource scheduling (Q880528):

Displaying 11 items.

• Handling precedence constraints in scheduling problems by the sequence pair representation (Q511691) (← links)
• Resource allocation with time intervals (Q606987) (← links)
• Project scheduling with finite or infinite number of activity processing modes -- a survey (Q621683) (← links)
• Time-constrained project scheduling with adjacent resources (Q709144) (← links)
• Scheduling under the network of temporo-spatial proximity relationships (Q1652320) (← links)
• Exact and approximate methods for parallel multiple-area spatial scheduling with release times (Q2393121) (← links)
• Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width (Q2436669) (← links)
• On minimizing dataset transfer time in an acyclic network with four servers (Q2959189) (← links)
• Batching-Based Approaches for Optimized Packing of Jobs in the Spatial Scheduling Problem (Q4634982) (← links)
• Ship Traffic Optimization for the Kiel Canal (Q5126634) (← links)
• Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs (Q6066713) (← links)