Pages that link to "Item:Q3367031"

The following pages link to Coordinated scheduling of customer orders for quick response (Q3367031):

Displaying 22 items.

• An order scheduling problem with position-based learning effect (Q342484) (← links)
• Minimizing the sum of weighted completion times in a concurrent open shop (Q613333) (← links)
• Dynamic management of a portfolio of orders. (Abstract of thesis) (Q816436) (← links)
• 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)
• Scheduling orders for multiple product types to minimize total weighted completion time (Q881573) (← links)
• The selection and scheduling of textile orders with due dates (Q1263516) (← 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)
• Order scheduling with tardiness objective: improved approximate solutions (Q1754153) (← links)
• Tailoring customer order scheduling search algorithms (Q2003430) (← links)
• Finding efficient make-to-order production and batch delivery schedules (Q2242200) (← links)
• Customer order scheduling to minimize the number of late jobs (Q2371386) (← links)
• Integrated production and transportation scheduling with order-dependent inventory holding costs (Q2669571) (← links)
• Assembly flowshop scheduling problem: speed-up procedure and computational evaluation (Q2670518) (← links)
• Scheduling on parallel machines to minimise maximum lateness for the customer order problem (Q2873094) (← links)
• Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time (Q2892135) (← links)
• Scheduling with High Variety of Customized Compound Products (Q3011187) (← links)
• Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints (Q5060512) (← links)
• The customer order lead-time problem on parallel machines (Q5687639) (← links)