Two problems about single machine parallel batching with batching costs
Abstract：We assume that the jobs and the machine are available from time zero onwards.The jobs that are processed together form a batch and once processed the job can＇t be interrupted.The processing time of a batch is equal to the maximum processing time of any job assigned to it.Furthermore,we assume that there is a batching cost for each batch.We give a pseudo-polynomial time algorithm for the first problem of minimizing the sum of the arbitrary regular function and batching costs.The second problem is the problem of minimizing the sum of the number of late jobs and batching costs,and we solve it by using an algorithm.
Keywords：single machineparallel batchregular functionlate jobbatching costdynamic programming
Publication Date：2011-07-02
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：3( 8-10 )