Pages that link to "Item:Q5711727"

The following pages link to Minimizing the total completion time on-line on a single machine, using restarts (Q5711727):

Displaying 13 items.

• Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart (Q281805) (← links)
• An optimal online algorithm for single machine scheduling to minimize total general completion time (Q421265) (← links)
• Optimal algorithms for online single machine scheduling with deteriorating jobs (Q442286) (← links)
• A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan (Q657251) (← links)
• Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time (Q837179) (← links)
• On-line scheduling on a batch machine to minimize makespan with limited restarts (Q935242) (← links)
• Online scheduling in a parallel batch processing system to minimize makespan using restarts (Q1022602) (← links)
• Online scheduling to minimize modified total tardiness with an availability constraint (Q1034623) (← links)
• Online scheduling with delivery time on a bounded parallel batch machine with limited restart (Q1666180) (← links)
• Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart (Q2250440) (← links)
• Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time (Q4561187) (← links)
• Online Single Machine Scheduling to Minimize the Maximum Starting Time (Q4595323) (← links)
• An Online Scheduling Problem on a Drop-Line Parallel Batch Machine with Delivery Times and Limited Restart (Q5024917) (← links)