Scheduling algorithms to minimize utility work at a single station on a paced assembly line

Definición y Evaluación de la dificultad del problema de secuenciación de unidades homogéneas

“…Bolat and Yano (Bolat & Yano, 1992) propronen un enfoque analítico para determinar cómo "derivar" reglas de secuenciación. Considerando dos tiempos de proceso (con y sin una opción) para un mismo centro de trabajo, el tiempo de ciclo así como la longitud de la estación, los autores proponen fijar una regla de secuenciación de tipo L:M. Con este enfoque, pretenden demostrar que las secuencias CS (Car Sequencing) factibles llevan a secuencias MMS (Mixed-Model Sequencing) factibles y viceversa.…”

A heuristic based on Vogel's approximation method for sequencing mixed-model assembly lines

“…Common approaches are mathematical models which can be handled by commercial solvers (cf. Bard et al 1992, Bolat and Yano 1992a, Bolat 1994, Scholl et al 1998, Sarker and Pan 2001 and branch and bound procedures (cf. Bard et al 1994, Bolat 1994, Xiaobo and Ohno 1997.…”

A hybrid dynamic programming for solving a mixed-model sequencing problem with production mix restriction and free interruptions

“…The original problem, MMSP-W, is an NP-hard problem [3] for which several alternative procedures have been proposed. These solutions include exact procedures based on branchand-bound ( [16]), dynamic programming ( [3], [17], [18]), heuristic procedures based on local search ( [19]), greedy algorithms with priority rules ( [19], [20]), metaheuristics ( [21]) and beam search ( [22]). Several studies have also considered the multi-criteria option (( [23], [24], [25], [26]).…”