Stochastic procedures for scheduling minimum job sets on mixed model assembly lines

DOI10.1057/palgrave.jors.2600391zbMath0882.90065OpenAlexW2012740425MaRDI QIDQ4347414

Ahmet Bolat

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

zbMATH Keywords

heuristicssimulated annealingsequencinglower boundsstochastic algorithmsmixed model assembly linepaced line

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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