Pages that link to "Item:Q1412717"

The following pages link to An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time. (Q1412717):

Displaying 11 items.

• Exact algorithms for single-machine scheduling with time windows and precedence constraints (Q310349) (← links)
• The prize-collecting scheduling problem with deadlines (Q510929) (← links)
• Scheduling about a common due date with earliness and tardiness penalties (Q908845) (← links)
• On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems (Q985311) (← links)
• Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates (Q1761994) (← links)
• A Lagrangian approach to single-machine scheduling problems with two competing agents (Q2268518) (← links)
• Pareto optima for total weighted completion time and maximum lateness on a single machine (Q2457015) (← links)
• A bucket indexed formulation for nonpreemptive single machine scheduling problems (Q2806861) (← links)
• Technical Note—An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines (Q3030557) (← links)
• Minimizing Weighted Completion Times with Deadlines (Q3694968) (← links)
• Minimizing the weighted sum of quadratic completion times on a single machine (Q4859582) (← links)