Pages that link to "Item:Q5687639"
From MaRDI portal
The following pages link to The customer order lead-time problem on parallel machines (Q5687639):
Displayed 13 items.
- Customer order scheduling on a single machine with family setup times: complexity and algorithms (Q870129) (← links)
- Scheduling parallel machines for the customer order problem (Q880492) (← links)
- Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time (Q940879) (← links)
- Minimizing customer order lead-time in a two-stage assembly supply chain (Q940914) (← 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)
- The complexity of customer order scheduling problems on parallel machines (Q1777163) (← links)
- Scheduling the production of two-component jobs on a single machine (Q1969827) (← 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)
- 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)