Pages that link to "Item:Q2926062"

The following pages link to Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time (Q2926062):

Displaying 10 items.

• Single machine scheduling problem with interval processing times to minimize mean weighted completion time (Q337133) (← links)
• Competitive analysis of preemptive single-machine scheduling (Q614049) (← links)
• An iterative heuristic for the single machine dynamic total completion time scheduling problem (Q1919773) (← links)
• Discrete and continuous-time formulations for dealing with break periods: preemptive and non-preemptive scheduling (Q1999390) (← links)
• An exact algorithm for the preemptive single machine scheduling of equal-length jobs (Q2147002) (← links)
• Preemptive scheduling in a two-stage supply chain to minimize the makespan (Q3458814) (← links)
• Minimizing the sum of weighted completion times of n-independent jobs when resource availability varies over time: Performance of a simple priority rule (Q3768666) (← links)
• The Deadline Constrained Weighted Completion Time Problem: Analysis of a Heuristic (Q3812023) (← links)
• (Q4528340) (← links)
• (Q4828982) (← links)