Pages that link to "Item:Q5183257"
From MaRDI portal
The following pages link to Optimal Elimination Methods in the <i>m</i> × <i>n</i> Flow-Shop Scheduling Problem (Q5183257):
Displaying 13 items.
- Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times (Q342351) (← links)
- Generating improved dominance conditions for the flowshop problem (Q580164) (← links)
- Elimination conditions and lower bounds for the permutation flow-shop sequencing problem (Q581221) (← links)
- Minimizing total tardiness in permutation flowshops (Q1127155) (← links)
- A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops (Q1260741) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem (Q1278537) (← links)
- Two models for a family of flowshop sequencing problems (Q1848365) (← links)
- A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem (Q2178110) (← links)
- Flowshop scheduling research after five decades (Q2572844) (← links)
- Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem (Q2664317) (← links)
- A new lower bounding rule for permutation flow shop scheduling (Q2766112) (← links)
- A heuristic algorithm to schedule work in the repair industry (Q3354848) (← links)
