Pages that link to "Item:Q2379955"
From MaRDI portal
The following pages link to Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines (Q2379955):
Displaying 13 items.
- An order scheduling problem with position-based learning effect (Q342484) (← 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)
- New approximate algorithms for the customer order scheduling problem with total completion time objective (Q1652070) (← links)
- Splitting versus setup trade-offs for scheduling to minimize weighted completion time (Q1694777) (← links)
- Order scheduling with tardiness objective: improved approximate solutions (Q1754153) (← links)
- Modeling single machine preemptive scheduling problems for computational efficiency (Q2288995) (← links)
- Quality of move-optimal schedules for minimizing total weighted completion time (Q2480059) (← links)
- Preemptive multiprocessor order scheduling to minimize total weighted flowtime (Q2482817) (← links)
- Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines (Q2664447) (← links)
- Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost (Q3120568) (← links)
- Minimizing the earliness-tardiness for the customer order scheduling problem in a dedicated machine environment (Q6657881) (← links)
