Batch scheduling on two-machine flowshop with machine-dependent setup times

Daniel Oron; Lika Ben-Dati; Gur Mosheiov

doi:10.1155/2009/153910

Batch scheduling on two-machine flowshop with machine-dependent setup times

Daniel Oron^*, Lika Ben-Dati, Gur Mosheiov

^*Corresponding author for this work

BA Business Department

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

4 Scopus citations

Abstract

We study a batch scheduling problem on a 2-machine flowshop. We assume unit processing time jobs, batch availability, and machine-dependent setup times. The objective is to find a job allocation to batches of integer size and a batch schedule that minimize makespan. We introduce a very efficient closed form solution for the problem.

Original language	English
Article number	153910
Journal	Advances in Operations Research
Volume	2009
DOIs	https://doi.org/10.1155/2009/153910
State	Published - 2009

Access to Document

10.1155/2009/153910

Cite this

@article{7a33b24630de49988cb5b5d75da97829,

title = "Batch scheduling on two-machine flowshop with machine-dependent setup times",

abstract = "We study a batch scheduling problem on a 2-machine flowshop. We assume unit processing time jobs, batch availability, and machine-dependent setup times. The objective is to find a job allocation to batches of integer size and a batch schedule that minimize makespan. We introduce a very efficient closed form solution for the problem.",

author = "Daniel Oron and Lika Ben-Dati and Gur Mosheiov",

year = "2009",

doi = "10.1155/2009/153910",

language = "אנגלית",

volume = "2009",

journal = "Advances in Operations Research",

issn = "1687-9147",

publisher = "John Wiley and Sons Ltd",

}

TY - JOUR

T1 - Batch scheduling on two-machine flowshop with machine-dependent setup times

AU - Oron, Daniel

AU - Ben-Dati, Lika

AU - Mosheiov, Gur

PY - 2009

Y1 - 2009

N2 - We study a batch scheduling problem on a 2-machine flowshop. We assume unit processing time jobs, batch availability, and machine-dependent setup times. The objective is to find a job allocation to batches of integer size and a batch schedule that minimize makespan. We introduce a very efficient closed form solution for the problem.

AB - We study a batch scheduling problem on a 2-machine flowshop. We assume unit processing time jobs, batch availability, and machine-dependent setup times. The objective is to find a job allocation to batches of integer size and a batch schedule that minimize makespan. We introduce a very efficient closed form solution for the problem.

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

U2 - 10.1155/2009/153910

DO - 10.1155/2009/153910

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

AN - SCOPUS:79958162518

SN - 1687-9147

VL - 2009

JO - Advances in Operations Research

JF - Advances in Operations Research

M1 - 153910

ER -

Batch scheduling on two-machine flowshop with machine-dependent setup times

Abstract

Access to Document

Other files and links

Fingerprint

Cite this