Pages that link to "Item:Q3030557"
From MaRDI portal
The following pages link to Technical Note—An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines (Q3030557):
Displaying 7 items.
- Reducibility among single machine weighted completion time scheduling problems (Q922287) (← links)
- A GRASP for a difficult single machine scheduling problem (Q1184452) (← links)
- Scheduling unit processing time jobs on a single machine with multiple criteria (Q1823849) (← links)
- Minimizing the sum of weighted completion times with unrestricted weights (Q1902889) (← links)
- Pareto optima for total weighted completion time and maximum lateness on a single machine (Q2457015) (← links)
- A branch and bound algorithm for minimizing weighted completion times with deadlines (Q3835632) (← links)
- Dynamic scheduling in manufacturing systems using Brownian approximations (Q5955769) (← links)
