Pages that link to "Item:Q1290642"
From MaRDI portal
The following pages link to Minimizing average completion time in the presence of release dates (Q1290642):
Displayed 16 items.
- On-line scheduling to minimize average completion time revisited. (Q703266) (← links)
- Preemption in single machine earliness/tardiness scheduling (Q835565) (← links)
- Scheduling problems in master-slave model (Q940888) (← links)
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
- An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time (Q991796) (← links)
- Interval-indexed formulation based heuristics for single machine total weighted tardiness problem (Q1001009) (← links)
- LP-based online scheduling: From single to parallel machines (Q1013970) (← links)
- A 1. 47-approximation for a preemptive single-machine scheduling problem (Q1577468) (← links)
- Randomized algorithms for on-line scheduling problems: How low can't you go? (Q1612009) (← links)
- A class of on-line scheduling algorithms to minimize total completion time (Q1811633) (← links)
- Common due date assignment and scheduling with ready times (Q1867095) (← links)
- Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem (Q2482376) (← links)
- The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates (Q2490322) (← links)
- On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems (Q2503352) (← links)
- Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems (Q5459996) (← links)
- Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates (Q5952071) (← links)