A polynomial algorithm for a one machine batching problem

A polynomial algorithm for a one machine batching problem

0.00 Avg rating0 Votes
Article ID: iaor1993535
Country: Netherlands
Volume: 11
Issue: 4
Start Page Number: 213
End Page Number: 218
Publication Date: May 1992
Journal: Operations Research Letters
Authors:
Keywords: programming: integer
Abstract:

A problem of batching identical jobs on a single machine is studied. Constant processing times and batch setup times are assumed. An algorithm is presented to minimize the sum over all jobs of the batched completion times, and shown to run in time polynomial in the logarithms of the problem parameters.

Reviews

Required fields are marked *. Your email address will not be published.