Pages that link to "Item:Q5438523"
From MaRDI portal
The following pages link to Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel (Q5438523):
Displaying 12 items.
- An order scheduling problem with position-based learning effect (Q342484) (← 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)
- Scheduling orders for multiple product types to minimize total weighted completion time (Q881573) (← links)
- Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time (Q940879) (← 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)
- Preemptive multiprocessor order scheduling to minimize total weighted flowtime (Q2482817) (← links)
- Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine (Q2686863) (← links)
- Scheduling on parallel machines to minimise maximum lateness for the customer order problem (Q2873094) (← links)
- Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines (Q4578168) (← links)
