An improved on-line algorithm for single parallel-batch machine scheduling with delivery times

Abstract

We study an on-line single parallel-batch machine scheduling problem where each job has a processing time and a delivery time. Jobs arrive over time and the batch capacity is unbounded. Jobs can be processed in a common batch, and each job is delivered independently and immediately at its completion time on the machine. The objective is to minimize the time… (More)
DOI: 10.1016/j.dam.2011.12.002

2 Figures and Tables

Topics

  • Presentations referencing similar topics