A single machine batch scheduling problem with bounded batch size

Gur Mosheiov; Daniel Oron

doi:10.1016/j.ejor.2006.01.052

A single machine batch scheduling problem with bounded batch size

Gur Mosheiov^*, Daniel Oron

^*Corresponding author for this work

Business Administration

Research output: Contribution to journal › Article › peer-review

32 Scopus citations

Abstract

We address a single-machine batch scheduling problem to minimize total flow time. Processing times are assumed to be identical for all jobs. Setup times are assumed to be identical for all batches. As in many practical situations, batch sizes may be bounded. In the first setting studied in this paper, all batch sizes cannot exceed a common upper bound. In the second setting, all batch sizes share a common lower bound. An optimal solution consists of the number of batches and their (integer) size. We introduce an efficient solution for both problems.

Original language	English
Pages (from-to)	1069-1079
Number of pages	11
Journal	European Journal of Operational Research
Volume	187
Issue number	3
DOIs	https://doi.org/10.1016/j.ejor.2006.01.052
State	Published - 16 Jun 2008

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. We wish to thank two anonymous referees for their helpful comments.

Keywords

Deterministic batch scheduling
Flow-time
Single machine

Access to Document

10.1016/j.ejor.2006.01.052

Cite this

@article{b2887b79d44d4a94ab7dd8ec0741e0c2,

title = "A single machine batch scheduling problem with bounded batch size",

abstract = "We address a single-machine batch scheduling problem to minimize total flow time. Processing times are assumed to be identical for all jobs. Setup times are assumed to be identical for all batches. As in many practical situations, batch sizes may be bounded. In the first setting studied in this paper, all batch sizes cannot exceed a common upper bound. In the second setting, all batch sizes share a common lower bound. An optimal solution consists of the number of batches and their (integer) size. We introduce an efficient solution for both problems.",

keywords = "Deterministic batch scheduling, Flow-time, Single machine",

author = "Gur Mosheiov and Daniel Oron",

note = "Funding Information: This paper was supported in part by the Recanati Fund of the School of Business Administration, The Hebrew University, Jerusalem, Israel. We wish to thank two anonymous referees for their helpful comments. ",

year = "2008",

month = jun,

day = "16",

doi = "10.1016/j.ejor.2006.01.052",

language = "אנגלית",

volume = "187",

pages = "1069--1079",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - A single machine batch scheduling problem with bounded batch size

AU - Mosheiov, Gur

AU - Oron, Daniel

N1 - Funding Information: This paper was supported in part by the Recanati Fund of the School of Business Administration, The Hebrew University, Jerusalem, Israel. We wish to thank two anonymous referees for their helpful comments.

PY - 2008/6/16

Y1 - 2008/6/16

N2 - We address a single-machine batch scheduling problem to minimize total flow time. Processing times are assumed to be identical for all jobs. Setup times are assumed to be identical for all batches. As in many practical situations, batch sizes may be bounded. In the first setting studied in this paper, all batch sizes cannot exceed a common upper bound. In the second setting, all batch sizes share a common lower bound. An optimal solution consists of the number of batches and their (integer) size. We introduce an efficient solution for both problems.

AB - We address a single-machine batch scheduling problem to minimize total flow time. Processing times are assumed to be identical for all jobs. Setup times are assumed to be identical for all batches. As in many practical situations, batch sizes may be bounded. In the first setting studied in this paper, all batch sizes cannot exceed a common upper bound. In the second setting, all batch sizes share a common lower bound. An optimal solution consists of the number of batches and their (integer) size. We introduce an efficient solution for both problems.

KW - Deterministic batch scheduling

KW - Flow-time

KW - Single machine

UR - http://www.scopus.com/inward/record.url?scp=36849035699&partnerID=8YFLogxK

U2 - 10.1016/j.ejor.2006.01.052

DO - 10.1016/j.ejor.2006.01.052

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:36849035699

SN - 0377-2217

VL - 187

SP - 1069

EP - 1079

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 3

ER -

A single machine batch scheduling problem with bounded batch size

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this