Pages that link to "Item:Q2482817"
From MaRDI portal
The following pages link to Preemptive multiprocessor order scheduling to minimize total weighted flowtime (Q2482817):
Displaying 8 items.
- An order scheduling problem with position-based learning effect (Q342484) (← links)
- Scheduling orders for multiple product types to minimize total weighted completion time (Q881573) (← links)
- Allowable processing orders in the accelerated cascade algorithm (Q1072941) (← links)
- Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures (Q1622791) (← links)
- Metaheuristics for order scheduling problem with unequal ready times (Q1727107) (← links)
- Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines (Q2379955) (← links)
- Solving customer order scheduling problems with an iterated greedy algorithm (Q6606519) (← links)
- Minimizing the earliness-tardiness for the customer order scheduling problem in a dedicated machine environment (Q6657881) (← links)
