The following pages link to (Q5286651):
Displayed 14 items.
- Hybrid flowshop scheduling with interstage job transportation (Q489104) (← links)
- Scheduling \(UET\)-tasks on a star network: complexity and approximation (Q538278) (← links)
- Scheduling tasks with exponential duration on unrelated parallel machines (Q714038) (← links)
- Flowshop scheduling with interstage job transportation (Q892841) (← links)
- Complexity and approximation for precedence constrained scheduling problems with large communication delays (Q935152) (← links)
- An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications. (Q1401200) (← links)
- Linear and quadratic algorithms for scheduling chains and opposite chains (Q1600834) (← links)
- A very difficult scheduling problem with communication delays (Q1604057) (← links)
- Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays (Q1631647) (← links)
- Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility (Q1698061) (← links)
- An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications (Q1853631) (← links)
- Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors (Q1904737) (← links)
- Scheduling trees with large communication delays on two identical processors (Q2464442) (← links)
- (Q4943556) (← links)