Pages that link to "Item:Q881573"

The following pages link to Scheduling orders for multiple product types to minimize total weighted completion time (Q881573):

Displaying 27 items.

• An order scheduling problem with position-based learning effect (Q342484) (← links)
• Cost-sharing mechanisms for scheduling under general demand settings (Q439369) (← links)
• Minimizing the sum of weighted completion times in a concurrent open shop (Q613333) (← links)
• Scheduling distributed clusters of parallel machines : primal-dual and LP-based approximation algorithms (Q722523) (← links)
• Minimizing maximum delivery completion time for order scheduling with rejection (Q830938) (← links)
• Order scheduling in an environment with dedicated resources in parallel (Q880508) (← 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)
• Optimal scheduling of purchasing orders for large projects (Q1308877) (← 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)
• On scheduling coflows (Q2211360) (← links)
• Customer order scheduling to minimize the number of late jobs (Q2371386) (← links)
• Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines (Q2379955) (← links)
• Preemptive multiprocessor order scheduling to minimize total weighted flowtime (Q2482817) (← links)
• Scheduling orders for multiple product types with due date related objectives (Q2569034) (← 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)
• Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time (Q2892135) (← links)
• (Q2993028) (← links)
• Minimizing the Range of Order Completion Times with Multiple Job Classes (Q4273304) (← links)
• Optimal scheduling of products with common and unique components (Q4883817) (← links)
• Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints (Q5060512) (← links)
• (Q5092350) (← links)
• Select and permute: an improved online framework for scheduling to minimize weighted completion time (Q5919414) (← links)
• An order scheduling heuristic to minimize the total collation delays and the makespan in high-throughput make-to-order manufacturing systems (Q6168349) (← links)