Resequencing with parallel queues to minimize the maximum number of items in the overflow area

Resequencing with parallel queues to minimize the maximum number of items in the overflow area

0.00 Avg rating0 Votes
Article ID: iaor20163322
Volume: 63
Issue: 5
Start Page Number: 401
End Page Number: 415
Publication Date: Aug 2016
Journal: Naval Research Logistics (NRL)
Authors: , ,
Keywords: supply & supply chains, queues: applications, inventory, inventory: storage
Abstract:

This article treats an elementary optimization problem, where an inbound stream of successive items is to be resequenced with the help of multiple parallel queues in order to restore an intended target sequence. Whenever early items block the one item to be currently released into the target sequence, they are withdrawn from their queue and intermediately stored in an overflow area until their actual release is reached. We aim to minimize the maximum number of items simultaneously stored in the overflow area during the complete resequencing process. We met this problem in industry practice at a large German automobile producer, who has to resequence containers with car seats prior to the assembly process. We formalize the resulting resequencing problem and provide suited exact and heuristic solution algorithms. In our computational study, we also address managerial aspects such as how to properly avoid the negative effects of sequence alterations.

Reviews

Required fields are marked *. Your email address will not be published.