Lot scheduling on a single machine

In a practical situation, a manufacturer receives different orders from its customers. Different orders may contain different quantities of the product. Therefore, the manufacturer has to decide how to group these orders into different lots based on the capacity of the lot processing machine (such a...

Full description

Saved in:
Bibliographic Details
Published in:Information processing letters 2014-12, Vol.114 (12), p.718-722
Main Authors: Hou, Yung-Tsung, Yang, Dar-Li, Kuo, Wen-Hung
Format: Article
Language:English
Subjects:
Decision analysis
Lot scheduling
Mathematical problems
Order
Polynomials
Production capacity
Production scheduling
Scheduling
Single machine
Studies
Total completion time
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In a practical situation, a manufacturer receives different orders from its customers. Different orders may contain different quantities of the product. Therefore, the manufacturer has to decide how to group these orders into different lots based on the capacity of the lot processing machine (such as integrated circuit tester, heated container, etc.) and then decides the sequence of these lots. In this paper, we study a lot scheduling problem with orders which can be split. The objective is to minimize the total completion time of all orders. We show that this problem can be solved in polynomial time. •We study a lot scheduling problem with orders which can be split.•The objective is to minimize the total completion time of all orders.•We show that this problem can be solved in polynomial time.
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2014.06.016