Pages that link to "Item:Q880492"
From MaRDI portal
The following pages link to Scheduling parallel machines for the customer order problem (Q880492):
Displaying 16 items.
- An order scheduling problem with position-based learning effect (Q342484) (← 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)
- 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)
- Metaheuristics for order scheduling problem with unequal ready times (Q1727107) (← links)
- The complexity of customer order scheduling problems on parallel machines (Q1777163) (← links)
- Identical parallel machine scheduling with assurance of maximum waiting time for an emergency job (Q2185530) (← links)
- Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines (Q2379955) (← links)
- A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property (Q2456645) (← links)
- Preemptive multiprocessor order scheduling to minimize total weighted flowtime (Q2482817) (← links)
- Minimizing makespan of stochastic customer orders in cellular manufacturing systems with parallel machines (Q2664451) (← links)
- A learning-based two-stage optimization method for customer order scheduling (Q2669593) (← links)
- Scheduling on parallel machines to minimise maximum lateness for the customer order problem (Q2873094) (← links)
- The customer order lead-time problem on parallel machines (Q5687639) (← links)
