The following pages link to (Q5702308):
Displayed 12 items.
- Prioritized customer order scheduling to maximize throughput (Q323536) (← links)
- A note on the complexity of the concurrent open shop problem (Q880556) (← 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)
- New approximate algorithms for the customer order scheduling problem with total completion time objective (Q1652070) (← links)
- Tailoring customer order scheduling search algorithms (Q2003430) (← links)
- Optimization study of three-stage assembly flowshop problem in pharmacy automation dispensing systems (Q2147094) (← links)
- Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines (Q2379955) (← links)
- Integrated production and transportation scheduling with order-dependent inventory holding costs (Q2669571) (← links)
- Approximating Weighted Completion Time for Order Scheduling with Setup Times (Q3297757) (← links)
- Parallel machine scheduling with job assignment restrictions (Q5433529) (← links)
- An order scheduling heuristic to minimize the total collation delays and the makespan in high-throughput make-to-order manufacturing systems (Q6168349) (← links)