Publication
Operations Research Letters
Paper

A polynomial algorithm for a one machine batching problem

View publication

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. © 1992.

Date

01 Jan 1992

Publication

Operations Research Letters

Authors

Topics

Share