The equal allocation policy in open shop batch scheduling

B. Mor; G. Mosheiov; D. Oron

doi:10.1057/jors.2011.64

The equal allocation policy in open shop batch scheduling

B. Mor, G. Mosheiov, D. Oron

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

3 Scopus citations

Abstract

We study the optimality of the very practical policy of equal allocation of jobs to batches in batch scheduling problems on an m-machine open shop. The objective is minimum makespan. We assume unit processing time jobs, machine-dependent setup times and batch availability. We show that equal allocation is optimal for a two-machine and a three-machine open shop. Although, this policy is not necessarily optimal for larger size open shops, it is shown numerically to produce very close-to-optimal schedules.

Original language	English
Pages (from-to)	646-652
Number of pages	7
Journal	Journal of the Operational Research Society
Volume	63
Issue number	5
DOIs	https://doi.org/10.1057/jors.2011.64
State	Published - May 2012
Externally published	Yes

Keywords

batch scheduling
makespan
open shop

Access to Document

10.1057/jors.2011.64

Cite this

@article{9b9d70d16f5240f99b2829321f37574c,

title = "The equal allocation policy in open shop batch scheduling",

abstract = "We study the optimality of the very practical policy of equal allocation of jobs to batches in batch scheduling problems on an m-machine open shop. The objective is minimum makespan. We assume unit processing time jobs, machine-dependent setup times and batch availability. We show that equal allocation is optimal for a two-machine and a three-machine open shop. Although, this policy is not necessarily optimal for larger size open shops, it is shown numerically to produce very close-to-optimal schedules.",

keywords = "batch scheduling, makespan, open shop",

author = "B. Mor and G. Mosheiov and D. Oron",

year = "2012",

month = may,

doi = "10.1057/jors.2011.64",

language = "אנגלית",

volume = "63",

pages = "646--652",

journal = "Journal of the Operational Research Society",

issn = "0160-5682",

publisher = "Taylor and Francis Ltd.",

number = "5",

}

TY - JOUR

T1 - The equal allocation policy in open shop batch scheduling

AU - Mor, B.

AU - Mosheiov, G.

AU - Oron, D.

PY - 2012/5

Y1 - 2012/5

N2 - We study the optimality of the very practical policy of equal allocation of jobs to batches in batch scheduling problems on an m-machine open shop. The objective is minimum makespan. We assume unit processing time jobs, machine-dependent setup times and batch availability. We show that equal allocation is optimal for a two-machine and a three-machine open shop. Although, this policy is not necessarily optimal for larger size open shops, it is shown numerically to produce very close-to-optimal schedules.

AB - We study the optimality of the very practical policy of equal allocation of jobs to batches in batch scheduling problems on an m-machine open shop. The objective is minimum makespan. We assume unit processing time jobs, machine-dependent setup times and batch availability. We show that equal allocation is optimal for a two-machine and a three-machine open shop. Although, this policy is not necessarily optimal for larger size open shops, it is shown numerically to produce very close-to-optimal schedules.

KW - batch scheduling

KW - makespan

KW - open shop

UR - https://www.scopus.com/pages/publications/84860003658

U2 - 10.1057/jors.2011.64

DO - 10.1057/jors.2011.64

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

AN - SCOPUS:84860003658

SN - 0160-5682

VL - 63

SP - 646

EP - 652

JO - Journal of the Operational Research Society

JF - Journal of the Operational Research Society

IS - 5

ER -

The equal allocation policy in open shop batch scheduling

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this