Single machine scheduling with batch-dependent setup times

Gur Mosheiov*, Daniel Oron

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

Abstract

We address a single-machine batch scheduling problem. The setup times (incurred whenever starting a new batch) are assumed to be a function of the number of batches processed previously, i.e., batch-dependent. The objective is minimum total flow-time. We focus on the case of identical processing time jobs. Given the number of jobs and the setup times, we have to determine the optimal number of batches and their (integer) size. An efficient (O(n)) solution procedure is introduced.

Original languageAmerican English
Pages (from-to)73-78
Number of pages6
JournalInformation Processing Letters
Volume98
Issue number2
DOIs
StatePublished - 30 Apr 2006

Bibliographical note

Funding Information:
This paper was supported in part by the Recanati Fund of the School of Business Administration, the Hebrew University, Jerusalem, Israel.

Keywords

  • Flow-time
  • Scheduling
  • Setup times
  • Single machine

Fingerprint

Dive into the research topics of 'Single machine scheduling with batch-dependent setup times'. Together they form a unique fingerprint.

Cite this