Title: Semicontinuous Batch Processor Scheduling with Release Time
Abstract: We consider the problem of semicontinuous batch scheduling arisen in the heating-process of blooms in the iron and steel industry.Jobs are processed in batch,the processing time of jobs in the same batch is the longest processing time of jobs in the batch and the jobs enter or leave the machine one after another in periods.The capacity of the machine is C,which can handle up to C jobs simultaneously.The capacity of a batch is the size of batch;the processing time of a batch is related to its size,the longest processing time of jobs in the batch and the capacity of the machine.In this paper,we assume that the job release time and processing time are agreeable.For the problem to minimize makespan,we study the characterizations of the optimal batching and then turn into nondecreasing order of the release time,process in batches and obtain the minimize makespan.On that basis,we present a dynamic programming algorithm with complexity of O(n2) and prove properties of the optimal solution,and give a numerical example to explain the process of algorithm.
Publication Year: 2012
Publication Date: 2012-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot