The following pages link to Open shops with jobs overlap (Q1319530):
Displaying 22 items.
- Minimizing the sum of weighted completion times in a concurrent open shop (Q613333) (← links)
- Open shops with jobs overlap -- revisited (Q706904) (← links)
- Scheduling distributed clusters of parallel machines : primal-dual and LP-based approximation algorithms (Q722523) (← links)
- Minimizing maximum delivery completion time for order scheduling with rejection (Q830938) (← 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)
- Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures (Q1622791) (← links)
- New approximate algorithms for the customer order scheduling problem with total completion time objective (Q1652070) (← links)
- Partially concurrent open shop scheduling with integral preemptions (Q1698281) (← links)
- Order scheduling with tardiness objective: improved approximate solutions (Q1754153) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
- Customer order scheduling to minimize the number of late jobs (Q2371386) (← links)
- The representation of partially-concurrent open shop problems (Q2398435) (← 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)
- A learning-based two-stage optimization method for customer order scheduling (Q2669593) (← 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)
