Pages that link to "Item:Q4147823"

The following pages link to A General Bounding Scheme for the Permutation Flow-Shop Problem (Q4147823):

Displaying 50 items.

• Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times (Q342351) (← links)
• Permutation flow shop scheduling with order acceptance and weighted tardiness (Q419558) (← 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)
• A unified framework for population-based metaheuristics (Q646652) (← links)
• Non-permutation flow shop scheduling with order acceptance and weighted tardiness (Q670790) (← links)
• On the heuristic solution of the permutation flow shop problem by path algorithms (Q690012) (← links)
• Scheduling preemptive open shops to minimize total tardiness (Q707141) (← links)
• Algorithms for two-machine flow-shop sequencing with precedence constraints (Q800822) (← links)
• Branch and bound algorithm for the flow shop with multiple processors (Q809880) (← links)
• Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems (Q856670) (← links)
• An exact parallel method for a bi-objective permutation flowshop problem (Q857297) (← links)
• A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems (Q858325) (← 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)
• A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop (Q1121779) (← links)
• Minimizing total tardiness in permutation flowshops (Q1127155) (← links)
• An adaptive branching rule for the permutation flow-shop problem (Q1141078) (← links)
• A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops (Q1260741) (← links)
• Two branch and bound algorithms for the permutation flow shop problem (Q1266538) (← 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)
• A new node selection strategy in the branch-and-bound procedure (Q1342946) (← links)
• Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. (Q1347602) (← links)
• Two-stage flowshop scheduling with a common second-stage machine (Q1373162) (← links)
• Minimizing the weighted number of tardy jobs on a two-machine flow shop. (Q1413849) (← links)
• An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. (Q1422367) (← links)
• Flow shop scheduling problem with conflict graphs (Q1708533) (← links)
• Exact exponential algorithms for 3-machine flowshop scheduling problems (Q1743653) (← links)
• A computational study of the permutation flow shop problem based on a tight lower bound (Q1777158) (← links)
• Lot streaming in the two-machine flow shop with setup times (Q1897371) (← links)
• Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints (Q2074672) (← 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)
• Competitive production scheduling: A two-firm, noncooperative finite dynamic game (Q2365098) (← links)
• Application of an optimization problem in max-plus algebra to scheduling problems (Q2433798) (← 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)
• Permutation flow shop scheduling with earliness and tardiness penalties (Q3055278) (← links)
• P2P B&B and GA for the Flow-Shop Scheduling Problem (Q3603121) (← links)
• SEQUENCING CONTROL OF PHYSICO‐CHEMICAL PROCESSES (Q3739031) (← links)
• General flow-shop scheduling with resource constraints (Q3780743) (← links)
• An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion (Q4812724) (← links)
• Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers (Q5057997) (← links)
• Généralisation Max-Plus des bornes de Lageweg, Lenstra et Rinnooy Kan (Q5479832) (← links)
• A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times (Q5937715) (← links)
• Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion (Q6103746) (← links)
• Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry (Q6109315) (← links)
• A branch-and-bound approach to the no-idle flowshop scheduling problem (Q6202953) (← links)