A common problem in production planning is to sequence a series of tasks so as to meet demand while satisfying operational constraints. This problem can be challenging to solve in its own right. It becomes even more challenging when higher-level decisions are also taken into account, such as which shifts should be selected to accommodate production. In this paper, we introduce the Shift-Selection and Task Sequencing (SS-TS) problem, develop the hybrid Test-and-Prune algorithm (T&P) to solve SS-TS, and present computational experiments based on a real-world problem in automotive stamping to demonstrate its effectiveness. In particular, we are able to solve, in very short run times, a number of problem instances that could not be solved through traditional integer programming methods. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Barlatt, A., Cohn, A. M., & Gusikhin, O. (2008). A hybrid approach for solving shift-selection and task-sequencing problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5015 LNCS, pp. 288–292). https://doi.org/10.1007/978-3-540-68155-7_24
Mendeley helps you to discover research relevant for your work.