Pages that link to "Item:Q4109479"

The following pages link to Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/<i>LP</i> Approach (Q4109479):

Displaying 40 items.

• A parallel ordering problem in facilities layout (Q336660) (← links)
• A nonmonotone GRASP (Q340011) (← links)
• Experimental analysis of crossover and mutation operators on the quadratic assignment problem (Q513133) (← links)
• Selected topics on assignment problems (Q697571) (← links)
• A survey for the quadratic assignment problem (Q852928) (← links)
• Scheduling batches on parallel machines with major and minor set-ups (Q918855) (← links)
• Effective formulation reductions for the quadratic assignment problem (Q976022) (← links)
• Locational analysis (Q1173002) (← links)
• A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem (Q1278325) (← links)
• Lower bounds for nonlinear assignment problems using many body interactions (Q1291723) (← links)
• Studying the effects of production loss due to setup in dynamic production scheduling (Q1319562) (← links)
• A robust strategy approach to a strategic mobility problem (Q1342065) (← links)
• A new exact algorithm for the solution of quadratic assignment problems (Q1343146) (← links)
• Learning complementarity and setup time reduction. (Q1406634) (← links)
• Improved exact approaches for row layout problems with departments of equal length (Q1651703) (← links)
• Evaluation of the multiobjective ant colony algorithm performances on biobjective quadratic assignment problems (Q1789471) (← links)
• A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem (Q1821011) (← links)
• A cutoff time strategy based on the coupon collector's problem (Q2184095) (← links)
• An efficient variable neighborhood search for the space-free multi-row facility layout problem (Q2242375) (← links)
• Convergence of the surrogate Lagrangian relaxation method (Q2260658) (← links)
• New exact approaches to row layout problems (Q2295979) (← links)
• Linear programming insights into solvable cases of the quadratic assignment problem (Q2339831) (← links)
• A revised reformulation-linearization technique for the quadratic assignment problem (Q2339837) (← links)
• A multi-parent genetic algorithm for the quadratic assignment problem (Q2359229) (← links)
• Massively parallel tabu search for the quadratic assignment problem (Q2367011) (← links)
• A classification of assembly line balancing problems (Q2371356) (← links)
• Website structure improvement: quadratic assignment problem approach and ant colony meta-heuristic technique (Q2467428) (← links)
• A hybrid metaheuristic for the quadratic assignment problem (Q2506186) (← links)
• A survey on problems and methods in generalized assembly line balancing (Q2569060) (← links)
• A survey of the parallel assembly lines balancing problem (Q2664411) (← links)
• A MILP model for the<i>n</i>-job,<i>M</i>-stage flowshop with sequence dependent set-up times (Q3743087) (← links)
• Analysis of partial setup strategies for solving the operational planning problem in parallel machine electronic assembly systems (Q4230119) (← links)
• Production and maintenance integrated planning (Q4230207) (← links)
• Product grouping for batch processes (Q4230294) (← links)
• Impact of sequence-dependent setup time on job shop scheduling performance (Q4394289) (← links)
• Applications of Quadratic Programming (Q4846562) (← links)
• Graph Similarity and Approximate Isomorphism (Q5005120) (← links)
• A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP (Q5106411) (← links)
• Characterizing linearizable QAPs by the level-1 reformulation-linearization technique (Q6122081) (← links)
• An LP-based characterization of solvable QAP instances with chess-board and graded structures (Q6168180) (← links)