Pages that link to "Item:Q4033755"
From MaRDI portal
The following pages link to Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops (Q4033755):
Displaying 16 items.
- Properties of optimal schedules in preemptive shop scheduling (Q628308) (← links)
- On the open-shop problem with preemption and minimizing the average completion time (Q703917) (← links)
- The bipartite margin shop and maximum red matchings free of blue-red alternating cycles (Q834189) (← links)
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
- The two-machine total completion time flow shop problem (Q1266536) (← links)
- On the complexity of preemptive openshop scheduling problems (Q1333531) (← links)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- Complexity of mixed shop scheduling problems: A survey (Q1969835) (← links)
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (Q2389828) (← links)
- (Q3033546) (← links)
- Integrality Property in Preemptive Parallel Machine Scheduling (Q3392940) (← links)
- (Q3806976) (← links)
- Mean Flow Time Minimization in Reentrant Job Shops with a Hub (Q4345597) (← links)
- Minimizing the Makespan and Flowtime in Two-Machine Stochastic Open Shops (Q5485388) (← links)
- A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP (Q5708850) (← links)
- Bounding the running time of algorithms for scheduling and packing problems (Q5890508) (← links)
