Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach

From MaRDI portal
Publication:4109479

DOI10.1287/opre.24.4.595zbMath0341.90030OpenAlexW2120583150MaRDI QIDQ4109479

Glenn W. Graves, A. M. Geoffrion

Publication date: 1976

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.24.4.595



Related Items

A multi-parent genetic algorithm for the quadratic assignment problem, Massively parallel tabu search for the quadratic assignment problem, A classification of assembly line balancing problems, A robust strategy approach to a strategic mobility problem, A new exact algorithm for the solution of quadratic assignment problems, A survey for the quadratic assignment problem, A parallel ordering problem in facilities layout, Improved exact approaches for row layout problems with departments of equal length, A nonmonotone GRASP, A MILP model for then-job,M-stage flowshop with sequence dependent set-up times, A survey of the parallel assembly lines balancing problem, Applications of Quadratic Programming, A cutoff time strategy based on the coupon collector's problem, A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP, Characterizing linearizable QAPs by the level-1 reformulation-linearization technique, An LP-based characterization of solvable QAP instances with chess-board and graded structures, Learning complementarity and setup time reduction., Scheduling batches on parallel machines with major and minor set-ups, Locational analysis, Graph Similarity and Approximate Isomorphism, Website structure improvement: quadratic assignment problem approach and ant colony meta-heuristic technique, An efficient variable neighborhood search for the space-free multi-row facility layout problem, Experimental analysis of crossover and mutation operators on the quadratic assignment problem, Selected topics on assignment problems, Impact of sequence-dependent setup time on job shop scheduling performance, Convergence of the surrogate Lagrangian relaxation method, Effective formulation reductions for the quadratic assignment problem, A hybrid metaheuristic for the quadratic assignment problem, Evaluation of the multiobjective ant colony algorithm performances on biobjective quadratic assignment problems, New exact approaches to row layout problems, A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem, A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem, Lower bounds for nonlinear assignment problems using many body interactions, A survey on problems and methods in generalized assembly line balancing, Linear programming insights into solvable cases of the quadratic assignment problem, A revised reformulation-linearization technique for the quadratic assignment problem, Analysis of partial setup strategies for solving the operational planning problem in parallel machine electronic assembly systems, Production and maintenance integrated planning, Product grouping for batch processes, Studying the effects of production loss due to setup in dynamic production scheduling