The following pages link to Open shops with jobs overlap (Q1319530):
Displayed 13 items.
- Minimizing the sum of weighted completion times in a concurrent open shop (Q613333) (← links)
- Open shops with jobs overlap -- revisited (Q706904) (← links)
- Order scheduling in an environment with dedicated resources in parallel (Q880508) (← links)
- A note on the complexity of the concurrent open shop problem (Q880556) (← links)
- Scheduling orders for multiple product types to minimize total weighted completion time (Q881573) (← links)
- Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps (Q1271382) (← links)
- On the complexity of preemptive openshop scheduling problems (Q1333531) (← links)
- Customer order scheduling to minimize the number of late jobs (Q2371386) (← links)
- Preemptive multiprocessor order scheduling to minimize total weighted flowtime (Q2482817) (← links)
- Scheduling orders for multiple product types with due date related objectives (Q2569034) (← links)
- Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time (Q2892135) (← links)
- Scheduling with centralized and decentralized batching policies in concurrent open shops (Q2994798) (← links)
- Order Scheduling Models: Hardness and Algorithms (Q5458825) (← links)