Pages that link to "Item:Q880508"

The following pages link to Order scheduling in an environment with dedicated resources in parallel (Q880508):

Displaying 33 items.

• An order scheduling problem with position-based learning effect (Q342484) (← links)
• Minimizing the total weighted completion time of fully parallel jobs with integer parallel units (Q393040) (← 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)
• 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)
• 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)
• The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic (Q1651546) (← 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)
• The complexity of customer order scheduling problems on parallel machines (Q1777163) (← links)
• Tailoring customer order scheduling search algorithms (Q2003430) (← links)
• Scheduling fully parallel jobs (Q2317138) (← links)
• Scheduling with constrained processor allocation for interval orders (Q2367418) (← links)
• Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines (Q2379955) (← links)
• The representation of partially-concurrent open shop problems (Q2398435) (← 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)
• Integrated production and transportation scheduling with order-dependent inventory holding costs (Q2669571) (← links)
• A learning-based two-stage optimization method for customer order scheduling (Q2669593) (← links)
• Assembly flowshop scheduling problem: speed-up procedure and computational evaluation (Q2670518) (← 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 Fully Parallel Jobs with Integer Parallel Units (Q2988818) (← links)
• Scheduling with centralized and decentralized batching policies in concurrent open shops (Q2994798) (← links)
• Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms (Q5139609) (← links)
• The customer order lead-time problem on parallel machines (Q5687639) (← links)
• An approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties (Q6566793) (← links)
• Solving customer order scheduling problems with an iterated greedy algorithm (Q6606519) (← links)
• Minimizing the earliness-tardiness for the customer order scheduling problem in a dedicated machine environment (Q6657881) (← links)