Pages that link to "Item:Q4065271"

The following pages link to A Comparative Study of Flow-Shop Algorithms (Q4065271):

Displaying 18 items.

• Elimination conditions and lower bounds for the permutation flow-shop sequencing problem (Q581221) (← links)
• Branch and bound algorithm for the flow shop with multiple processors (Q809880) (← links)
• A new integer programming formulation for the permutation flowshop problem (Q1121163) (← links)
• Ranking multiple criteria alternatives with half-space, convex, and non- convex dominating cones: Quasi-concave and quasi-convex multiple attribute utility functions (Q1121756) (← links)
• An adaptive branching rule for the permutation flow-shop problem (Q1141078) (← 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)
• Minimization of the makespan in a two-machine problem under given resource constraints (Q1296091) (← links)
• The interface of buffer design and cyclic scheduling decisions in deterministic flow lines (Q1339132) (← links)
• Two-stage flowshop scheduling with a common second-stage machine (Q1373162) (← links)
• A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem (Q2178110) (← links)
• Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems (Q2265944) (← links)
• A tabu-search heuristic for the flexible-resource flow shop scheduling problem (Q2367002) (← links)
• A Lagrangean relaxation approach for the mixed-model flow line sequencing problem (Q2456653) (← 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)
• (Q4949162) (← links)
• Flow shop-sequencing problem with synchronous transfers and makespan minimization (Q5438669) (← links)