Scheduling a single semi-continuous batching machine

This paper addresses a new problem, called semi-continuous batch scheduling, which arises in the heating-operation of tube-billets in the steel industry. Each heating furnace can be regarded as a semi-continuous batching machine, which can handle up to C jobs simultaneously. The jobs in the same bat...

Full description

Saved in:
Bibliographic Details
Published in:Omega (Oxford) Vol. 36; no. 6; pp. 992 - 1004
Main Authors: Tang, Lixin, Zhao, Yufang
Format: Journal Article
Language:English
Published: Oxford Elsevier Ltd 01.12.2008
Elsevier
Elsevier Science Publishers
Pergamon Press Inc
Series:Omega
Subjects:
Algorithms
Analysis
Batch processing
Dynamic programming
Dynamic programming algorithm
Heating
Production scheduling
Remote job entry
Scheduling
Scheduling Semi-continuous batching machine Dynamic programming algorithm
Semi-continuous batching machine
Steel industry
Studies
United Kingdom
Dynamic programming algorithm
Scheduling
Semi-continuous batching machine
ISSN:0305-0483, 1873-5274
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper addresses a new problem, called semi-continuous batch scheduling, which arises in the heating-operation of tube-billets in the steel industry. Each heating furnace can be regarded as a semi-continuous batching machine, which can handle up to C jobs simultaneously. The jobs in the same batch enter and leave the machine semi-continuously, which differs from the traditional batching machine scheduling where the jobs in same batch have a starting time and a finishing time. In this paper the processing time of a batch depends on the capacity of the semi-continuous batching machine, the longest processing time of jobs in the batch and its size. The objectives are to schedule jobs on the machine so that the makespan and the total completion time are minimized. A schedule for a semi-continuous batching machine consists of a batching and sequencing for the batches. We propose the optimal properties of two different objective functions and present the different dynamic programming algorithms with a running time of O ( n 2 ) , respectively.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0305-0483
1873-5274
DOI:10.1016/j.omega.2007.11.003