Pages that link to "Item:Q1974574"
From MaRDI portal
The following pages link to Scheduling identical jobs with chain precedence constraints on two uniform machines (Q1974574):
Displaying 12 items.
- 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)
- Fast LP models and algorithms for identical jobs on uniform parallel machines (Q727360) (← links)
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
- A comment on scheduling on uniform machines under chain-type precedence constraints (Q1977643) (← links)
- Ideal schedules in parallel machine settings (Q2029359) (← links)
- A metric approach for scheduling problems with minimizing the maximum penalty (Q2245804) (← links)
- Scheduling chains with identical jobs and constant delays on a single machine (Q2500785) (← links)
- Resource constrained chain scheduling of UET jobs on two machines (Q2781112) (← links)
- (Q3402864) (← links)
- Parallel Processing and Applied Mathematics (Q5307342) (← links)
- (Q6068238) (← links)