Pages that link to "Item:Q940879"
From MaRDI portal
The following pages link to Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time (Q940879):
Displaying 15 items.
- An order scheduling problem with position-based learning effect (Q342484) (← links)
- Modeling efficiency in the presence of multiple partial input to output processes (Q525832) (← 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)
- Scheduling orders for multiple product types to minimize total weighted completion time (Q881573) (← 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)
- Scheduling problems with position dependent job processing times: computational complexity results (Q1761835) (← 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)
- An order scheduling heuristic to minimize the total collation delays and the makespan in high-throughput make-to-order manufacturing systems (Q6168349) (← links)
- Production scheduling decision-making technology for multiple CNC machining centers with constraints on serviceable time (Q6657873) (← links)
- Minimizing the earliness-tardiness for the customer order scheduling problem in a dedicated machine environment (Q6657881) (← links)
