Pages that link to "Item:Q974714"
From MaRDI portal
The following pages link to A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times (Q974714):
Displaying 10 items.
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (Q336914) (← links)
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time (Q668523) (← links)
- Simulated annealing and genetic algorithm based method for a bi-level \textit{seru} loading problem with worker assignment in \textit{seru} production systems (Q2031373) (← links)
- Online scheduling to minimize the total weighted completion time plus the rejection cost (Q2410099) (← links)
- A \(2.28\)-competitive algorithm for online scheduling on identical machines (Q2514649) (← links)
- A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection (Q2662527) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- A Semi-Online Algorithm for Single Machine Scheduling with Rejection (Q5024475) (← links)
- On competitive analysis for polling systems (Q6072151) (← links)
- A competitive online algorithm for minimizing total weighted completion time on uniform machines (Q6534502) (← links)
