Pages that link to "Item:Q2569034"

The following pages link to Scheduling orders for multiple product types with due date related objectives (Q2569034):

Displaying 16 items.

• An order scheduling problem with position-based learning effect (Q342484) (← links)
• Minimizing maximum delivery completion time for order scheduling with rejection (Q830938) (← links)
• Scheduling orders for multiple product types to minimize total weighted completion time (Q881573) (← links)
• Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time (Q940879) (← links)
• Dynamic programming based algorithms for set multicover and multiset multicover problems (Q974740) (← links)
• Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures (Q1622791) (← links)
• Metaheuristics for order scheduling problem with unequal ready times (Q1727107) (← links)
• Two-machine flowshop scheduling in a physical examination center (Q1740429) (← links)
• Order scheduling with tardiness objective: improved approximate solutions (Q1754153) (← links)
• Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
• Customer order scheduling to minimize the number of late jobs (Q2371386) (← 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)
• Scheduling with centralized and decentralized batching policies in concurrent open shops (Q2994798) (← links)
• An approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties (Q6566793) (← links)