Pages that link to "Item:Q1811633"
From MaRDI portal
The following pages link to A class of on-line scheduling algorithms to minimize total completion time (Q1811633):
Displayed 22 items.
- Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine (Q280944) (← links)
- Online integrated production-distribution scheduling problems without preemption (Q281801) (← links)
- Online scheduling of simple linear deteriorating jobs to minimize the total general completion time (Q387011) (← 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)
- Reducing network and computation complexities in neural based real-time scheduling scheme (Q632870) (← links)
- On-line scheduling to minimize average completion time revisited. (Q703266) (← links)
- A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time'' (Q763490) (← links)
- Optimally competitive list batching (Q837154) (← links)
- Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time (Q837179) (← links)
- Job scheduling methods for reducing waiting time variance (Q878584) (← links)
- On-line scheduling of parallel machines to minimize total completion times (Q1010275) (← links)
- Online scheduling to minimize modified total tardiness with an availability constraint (Q1034623) (← links)
- Robust algorithms for total completion time (Q2010916) (← links)
- Applying ``peeling onion'' approach for competitive analysis in online scheduling with rejection (Q2029304) (← links)
- An optimal online algorithm for single-processor scheduling problem with learning effect (Q2079858) (← 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)
- Predictive-reactive strategy for identical parallel machine rescheduling (Q2669491) (← links)
- Online Non-preemptive Scheduling to Optimize Max Stretch on a Single Machine (Q2817891) (← links)
- Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms (Q5139609) (← links)
- On competitive analysis for polling systems (Q6072151) (← links)