首页>
外文OA文献
>One-machine batching and sequencing of multiple-type items
【2h】
One-machine batching and sequencing of multiple-type items
展开▼
机译：单机分批排序多种物料
展开▼
免费
页面导航
摘要
著录项
相似文献
相关主题
摘要
We consider a single-machine scheduling problem in which a given number of simultaneously available items of different types are to be processed. The items must first be batched and then sequenced before processing begins. Only items of the same type can be batched together. A setup time is incurred whenever a batch of a certain type of item is formed. The flowtime of an item in a batch is defined as the completion time of the batch that contains it. The problem is to find an optimal schedule in terms of the optimal batching and sequencing decisions that minimizes the total item flowtime. We present a dynamic programming algorithm to solve this problem. The algorithm has a running time polynomial in the number of items but exponential in the number of types.
展开▼
