Pages that link to "Item:Q421265"
From MaRDI portal
The following pages link to An optimal online algorithm for single machine scheduling to minimize total general completion time (Q421265):
Displaying 14 items.
- Online scheduling of simple linear deteriorating jobs to minimize the total general completion time (Q387011) (← links)
- Comments on ``Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine'' (Q625659) (← links)
- A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time'' (Q763490) (← links)
- Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine (Q829170) (← links)
- A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times (Q974714) (← links)
- An optimal online algorithm for single machine scheduling with bounded delivery times (Q1038322) (← links)
- Ordinal on-line scheduling for maximizing the minimum machine completion time (Q1598882) (← links)
- A class of on-line scheduling algorithms to minimize total completion time (Q1811633) (← links)
- An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times (Q1926488) (← links)
- Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost (Q2444843) (← links)
- On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions (Q3391992) (← links)
- (Q4528340) (← links)
- (Q4828982) (← links)
- Asymptotic Performance Ratio of an Online Algorithm for the Single Machine Scheduling With Release Dates (Q5273759) (← links)
