Pages that link to "Item:Q1602711"
From MaRDI portal
The following pages link to On-line scheduling with precedence constraints (Q1602711):
Displaying 14 items.
- Online hierarchical scheduling: an approach using mathematical programming (Q621843) (← links)
- Scheduling with bully selfish jobs (Q692928) (← links)
- A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints (Q714856) (← links)
- Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan (Q721932) (← links)
- On-line scheduling with non-crossing constraints (Q957355) (← links)
- Nearly on line scheduling of preemptive independent tasks (Q1346697) (← links)
- A note on on-line scheduling with precedence constraints on identical machines (Q1607065) (← links)
- A lower bound for on-line scheduling on uniformly related machines (Q1970423) (← links)
- On-line scheduling with monotone subsequence constraints (Q2319898) (← links)
- Online scheduling with unit processing times and processing set restrictions (Q2326081) (← links)
- Online Linear Optimization for Job Scheduling Under Precedence Constraints (Q2835641) (← links)
- Online Preemptive Scheduling with Immediate Decision or Notification and Penalties (Q3578339) (← links)
- On-line Scheduling with a Monotonous Subsequence Constraint (Q4632214) (← links)
- On-line scheduling with hard deadlines (Q5096944) (← links)