The following pages link to (Q2723565):
Displaying 8 items.
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
- The power of \(\alpha\)-points in preemptive single machine scheduling. (Q1600001) (← links)
- Approximation algorithms for shop scheduling problems with minsum objective (Q1607979) (← links)
- A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective (Q1755846) (← links)
- Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates (Q1761994) (← links)
- Resource-constrained project scheduling: Notation, classification, models, and methods (Q1806880) (← links)
- Unrelated Machine Scheduling with Stochastic Processing Times (Q3186530) (← links)
- Total completion time scheduling under scenarios (Q6574934) (← links)
