Pages that link to "Item:Q3030557"

The following pages link to Technical Note—An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines (Q3030557):

Displaying 12 items.

• A lower bound for weighted completion time variance (Q613431) (← links)
• Range of lower bounds (Q648257) (← links)
• Reducibility among single machine weighted completion time scheduling problems (Q922287) (← links)
• A GRASP for a difficult single machine scheduling problem (Q1184452) (← links)
• An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time. (Q1412717) (← 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 Global Constraint for Total Weighted Completion Time (Q3612411) (← links)
• The Deadline Constrained Weighted Completion Time Problem: Analysis of a Heuristic (Q3812023) (← 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)