Pages that link to "Item:Q1652070"
From MaRDI portal
The following pages link to New approximate algorithms for the customer order scheduling problem with total completion time objective (Q1652070):
Displaying 4 items.
- Minimizing maximum delivery completion time for order scheduling with rejection (Q830938) (← links)
- Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures (Q1622791) (← links)
- The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic (Q1651546) (← links)
- Order scheduling with tardiness objective: improved approximate solutions (Q1754153) (← links)
