Pages that link to "Item:Q1777163"
From MaRDI portal
The following pages link to The complexity of customer order scheduling problems on parallel machines (Q1777163):
Displaying 8 items.
- Minimizing maximum delivery completion time for order scheduling with rejection (Q830938) (← links)
- Customer order scheduling on a single machine with family setup times: complexity and algorithms (Q870129) (← links)
- A note on the complexity of the concurrent open shop problem (Q880556) (← 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)
- Spatial and temporal optimization for smart warehouses with fast turnover (Q2664446) (← links)
- Scheduling on parallel machines to minimise maximum lateness for the customer order problem (Q2873094) (← links)
- An order scheduling heuristic to minimize the total collation delays and the makespan in high-throughput make-to-order manufacturing systems (Q6168349) (← links)
