Stochastic procedures for scheduling minimum job sets on mixed model assembly lines
From MaRDI portal
Publication:4347414
DOI10.1057/palgrave.jors.2600391zbMath0882.90065MaRDI QIDQ4347414
Publication date: 10 March 1998
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600391
heuristics; simulated annealing; sequencing; lower bounds; stochastic algorithms; mixed model assembly line; paced line
90B35: Deterministic scheduling theory in operations research
Related Items
A scatter search based hyper-heuristic for sequencing a mixed-model assembly line, Solving the car sequencing problem via branch \& bound, Sequencing mixed-model assembly lines to minimize part inventory cost, Sequencing mixed-model assembly lines: survey, classification and model critique