Pages that link to "Item:Q3982632"
From MaRDI portal
The following pages link to A FLOWSHOP SCHEDULING ALGORITHM TO MINIMIZE TOTAL FLOWTIME (Q3982632):
Displaying 20 items.
- Scheduling chains to minimize mean flow time (Q290213) (← links)
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime (Q339553) (← links)
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (Q857333) (← links)
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion (Q959513) (← links)
- Flowshop sequencing with mean flowtime objective (Q1130072) (← links)
- Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems (Q1278545) (← links)
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs (Q1280126) (← links)
- Some results of the worst-case analysis for flow shop scheduling (Q1296692) (← links)
- Heuristics for scheduling in flowshop with multiple objectives (Q1388918) (← links)
- A heuristic algorithm for mean flowtime objective in flowshop scheduling (Q1389189) (← links)
- Concurrent flowshop scheduling to minimize makespan. (Q1429959) (← links)
- A linear time approximation algorithm for movement minimization in conveyor flow shop processing (Q1887913) (← links)
- A combination of flow shop scheduling and the shortest path problem (Q2354293) (← links)
- Heuristic algorithms for continuous flow-shop problem (Q3489781) (← links)
- Minimizing makespan and throughput times at Aalsmeer flower auction (Q3545655) (← links)
- (Q3610539) (← links)
- A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan (Q4290641) (← links)
- Algorithms for Flows over Time with Scheduling Costs (Q5041740) (← links)
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem (Q5946533) (← links)
- Maximizing Throughput in Flow Shop Real-Time Scheduling (Q6084409) (← links)