Batch scheduling on uniform machines to minimize total flow-time

Baruch Mor; Gur Mosheiov

doi:10.1016/j.cor.2011.05.014

Batch scheduling on uniform machines to minimize total flow-time

Baruch Mor, Gur Mosheiov

BA Business Department

The Hebrew University of Jerusalem

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

Abstract

The solution of the classical batch scheduling problem with identical jobs and setup times to minimize flowtime is known for twenty five years. In this paper we extend this result to a setting of two uniform machines with machine-dependent setup times. We introduce an O(n) solution for the relaxed version (allowing non-integer batch sizes), followed by a simple rounding procedure to obtain integer batch sizes.

Original language	English
Pages (from-to)	571-575
Number of pages	5
Journal	Computers and Operations Research
Volume	39
Issue number	3
DOIs	https://doi.org/10.1016/j.cor.2011.05.014
State	Published - Mar 2012

Keywords

Batch scheduling
Flowtime
Uniform machines

All Science Journal Classification (ASJC) codes

General Computer Science
Modelling and Simulation
Management Science and Operations Research

Access to Document

10.1016/j.cor.2011.05.014

Cite this

@article{f57608b8c141460eb444d884a5afeea8,

title = "Batch scheduling on uniform machines to minimize total flow-time",

abstract = "The solution of the classical batch scheduling problem with identical jobs and setup times to minimize flowtime is known for twenty five years. In this paper we extend this result to a setting of two uniform machines with machine-dependent setup times. We introduce an O(n) solution for the relaxed version (allowing non-integer batch sizes), followed by a simple rounding procedure to obtain integer batch sizes.",

keywords = "Batch scheduling, Flowtime, Uniform machines",

author = "Baruch Mor and Gur Mosheiov",

note = "Funding Information: The second author is the Charles Rosen Professor of Management, The School of Business Administration, The Hebrew University. This paper was supported in part by the Recanati Fund of the School of Business Administration, The Hebrew University, Jerusalem, Israel .",

year = "2012",

month = mar,

doi = "10.1016/j.cor.2011.05.014",

language = "الإنجليزيّة",

volume = "39",

pages = "571--575",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier Ltd.",

number = "3",

}

TY - JOUR

T1 - Batch scheduling on uniform machines to minimize total flow-time

AU - Mor, Baruch

AU - Mosheiov, Gur

N1 - Funding Information: The second author is the Charles Rosen Professor of Management, The School of Business Administration, The Hebrew University. This paper was supported in part by the Recanati Fund of the School of Business Administration, The Hebrew University, Jerusalem, Israel .

PY - 2012/3

Y1 - 2012/3

N2 - The solution of the classical batch scheduling problem with identical jobs and setup times to minimize flowtime is known for twenty five years. In this paper we extend this result to a setting of two uniform machines with machine-dependent setup times. We introduce an O(n) solution for the relaxed version (allowing non-integer batch sizes), followed by a simple rounding procedure to obtain integer batch sizes.

AB - The solution of the classical batch scheduling problem with identical jobs and setup times to minimize flowtime is known for twenty five years. In this paper we extend this result to a setting of two uniform machines with machine-dependent setup times. We introduce an O(n) solution for the relaxed version (allowing non-integer batch sizes), followed by a simple rounding procedure to obtain integer batch sizes.

KW - Batch scheduling

KW - Flowtime

KW - Uniform machines

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

U2 - 10.1016/j.cor.2011.05.014

DO - 10.1016/j.cor.2011.05.014

M3 - مقالة

SN - 0305-0548

VL - 39

SP - 571

EP - 575

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 3

ER -

Batch scheduling on uniform machines to minimize total flow-time

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this