.png){kind=icon}
Return
Scheduling a single semi-continuous batching machine
.png){kind=icon}
PRE
AI
DOI：10.1016/j.omega.2007.11.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 hatching 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 hatching 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 hatching 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. (C) 2007 Elsevier Ltd. All rights reserved.
Keywords:
scheduling
semi-continuous hatching machine
dynamic programming algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
O
IF:
7.2
Papers:
3.8K
Citations:
1.4W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
ShareSaveShareSave
View more