Open-shop batch scheduling with identical jobs

Gur Mosheiov; Daniel Oron

doi:10.1016/j.ejor.2006.03.068

Open-shop batch scheduling with identical jobs

Gur Mosheiov^*, Daniel Oron

^*Corresponding author for this work

Business Administration

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

33 Scopus citations

Abstract

This paper addresses batch scheduling problems on an m-machine open-shop. The objectives are minimum makespan and minimum flowtime. We assume identical processing time jobs, machine- and sequence-independent setup times and batch availability. The minimum makespan problem is shown to be solved in constant time. Specifically, we show that the optimal number of batches is either m or ⌈⌉ fenced(frac(n, ⌊ n / m ⌋)) (where m and n are the number of machines and the number of jobs, respectively). The complexity of the minimum flowtime problem is unknown. We propose an O(n) time algorithm which extends the solution of the single-machine case, and produces close-to-optimal solutions.

Original language	English
Pages (from-to)	1282-1292
Number of pages	11
Journal	European Journal of Operational Research
Volume	187
Issue number	3
DOIs	https://doi.org/10.1016/j.ejor.2006.03.068
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 three anonymous referees for their helpful comments.

Keywords

Batch scheduling
Flowtime
Makespan
Open-shop

Access to Document

10.1016/j.ejor.2006.03.068

Cite this

@article{ac1650980a604aea96dc2932e84db18c,

title = "Open-shop batch scheduling with identical jobs",

abstract = "This paper addresses batch scheduling problems on an m-machine open-shop. The objectives are minimum makespan and minimum flowtime. We assume identical processing time jobs, machine- and sequence-independent setup times and batch availability. The minimum makespan problem is shown to be solved in constant time. Specifically, we show that the optimal number of batches is either m or ⌈⌉ fenced(frac(n, ⌊ n / m ⌋)) (where m and n are the number of machines and the number of jobs, respectively). The complexity of the minimum flowtime problem is unknown. We propose an O(n) time algorithm which extends the solution of the single-machine case, and produces close-to-optimal solutions.",

keywords = "Batch scheduling, Flowtime, Makespan, Open-shop",

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 three anonymous referees for their helpful comments.",

year = "2008",

month = jun,

day = "16",

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

language = "אנגלית",

volume = "187",

pages = "1282--1292",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - Open-shop batch scheduling with identical jobs

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 three anonymous referees for their helpful comments.

PY - 2008/6/16

Y1 - 2008/6/16

N2 - This paper addresses batch scheduling problems on an m-machine open-shop. The objectives are minimum makespan and minimum flowtime. We assume identical processing time jobs, machine- and sequence-independent setup times and batch availability. The minimum makespan problem is shown to be solved in constant time. Specifically, we show that the optimal number of batches is either m or ⌈⌉ fenced(frac(n, ⌊ n / m ⌋)) (where m and n are the number of machines and the number of jobs, respectively). The complexity of the minimum flowtime problem is unknown. We propose an O(n) time algorithm which extends the solution of the single-machine case, and produces close-to-optimal solutions.

AB - This paper addresses batch scheduling problems on an m-machine open-shop. The objectives are minimum makespan and minimum flowtime. We assume identical processing time jobs, machine- and sequence-independent setup times and batch availability. The minimum makespan problem is shown to be solved in constant time. Specifically, we show that the optimal number of batches is either m or ⌈⌉ fenced(frac(n, ⌊ n / m ⌋)) (where m and n are the number of machines and the number of jobs, respectively). The complexity of the minimum flowtime problem is unknown. We propose an O(n) time algorithm which extends the solution of the single-machine case, and produces close-to-optimal solutions.

KW - Batch scheduling

KW - Flowtime

KW - Makespan

KW - Open-shop

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

U2 - 10.1016/j.ejor.2006.03.068

DO - 10.1016/j.ejor.2006.03.068

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

AN - SCOPUS:36849021148

SN - 0377-2217

VL - 187

SP - 1282

EP - 1292

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 3

ER -

Open-shop batch scheduling with identical jobs

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this