Single machine batch scheduling to minimize total completion time and resource consumption costs

  • Authors:
  • Dvir Shabtay;George Steiner

  • Affiliations:
  • Management Science and Information Systems Area, Michael G. DeGroote School of Business, McMaster University, Hamilton, Canada;Management Science and Information Systems Area, Michael G. DeGroote School of Business, McMaster University, Hamilton, Canada

  • Venue:
  • Journal of Scheduling
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we study the single-machine batch scheduling problem under batch availability, where both setup and job processing times are controllable by allocating a continuously divisible nonrenewable resource. Under batch availability a set of jobs is processed contiguously and completed together, when the processing of the last job in the batch is finished. We present polynomial time algorithms to find the job sequence, the partition of the job sequence into batches and the resource allocation, which minimize the total completion time or the total production cost (inventory plus resource costs).