Pages that link to "Item:Q5057424"
From MaRDI portal
The following pages link to Scheduling jobs that arrive over time (Q5057424):
Displaying 20 items.
- Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope (Q323058) (← links)
- From preemptive to non-preemptive speed-scaling scheduling (Q479009) (← links)
- On-line scheduling to minimize average completion time revisited. (Q703266) (← links)
- Scheduling coupled-operation jobs with exact time-lags (Q714025) (← links)
- Fixed-time schedules for the processing of jobs when service completions are not observable (Q814885) (← links)
- Optimally competitive list batching (Q837154) (← links)
- An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem (Q875429) (← links)
- A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates (Q941541) (← links)
- On-line scheduling of parallel machines to minimize total completion times (Q1010275) (← links)
- Periodic scheduling with obligatory vacations (Q1034630) (← links)
- Minimizing average completion time in the presence of release dates (Q1290642) (← links)
- Off-line admission control for general scheduling problems (Q1592760) (← links)
- New results on competitive analysis of online SRPT scheduling (Q2080035) (← links)
- On-line booking policies and competitive analysis of medical examination in hospital (Q2336398) (← links)
- Approximation techniques for average completion time scheduling (Q2719134) (← links)
- Decomposition Algorithm for the Single Machine Scheduling Polytope (Q3195338) (← links)
- Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds (Q4645931) (← links)
- Optimal on-line algorithms for single-machine scheduling (Q4645938) (← links)
- Approximation and Online Algorithms (Q5896935) (← links)
- On-line single-server dial-a-ride problems (Q5958715) (← links)
