Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times

Gur Mosheiov; Daniel Oron

doi:10.1016/j.cor.2011.09.011

Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times

Gur Mosheiov, Daniel Oron^*

^*Corresponding author for this work

BA Business Department

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

15 Scopus citations

Abstract

In various real life scheduling systems job processing times vary according to the number of jobs previously processed. The vast majority of studies assume a restrictive functional form to describe job processing times. In this note, we address a scheduling problem with the most general job processing time functions. The machine setting assumed is an m-machine proportionate flowshop, and the objective function is minimum number of tardy jobs. We show that the problem can be formulated as a bottleneck assignment problem with a maximum cardinality constraint. An efficient polynomial time (O(n⁴ log n)) solution is introduced.

Original language	English
Pages (from-to)	1601-1604
Number of pages	4
Journal	Computers and Operations Research
Volume	39
Issue number	7
DOIs	https://doi.org/10.1016/j.cor.2011.09.011
State	Published - Jul 2012

Bibliographical note

Funding Information:
The authors are grateful to the Associate Editor and the anonymous referees for their valuable feedback on an earlier version of the paper. The first author was supported by The Recanati Fund of The School of Business Administration, and The Charles Rosen Chair of Management, The Hebrew University, Jerusalem, Israel.

Keywords

Makespan
Minimum number of tardy jobs
Position-dependent processing times
Proportionate flowshop
Scheduling

Access to Document

10.1016/j.cor.2011.09.011

Cite this

@article{2b23dad596524f019e3595912468bab2,

title = "Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times",

abstract = "In various real life scheduling systems job processing times vary according to the number of jobs previously processed. The vast majority of studies assume a restrictive functional form to describe job processing times. In this note, we address a scheduling problem with the most general job processing time functions. The machine setting assumed is an m-machine proportionate flowshop, and the objective function is minimum number of tardy jobs. We show that the problem can be formulated as a bottleneck assignment problem with a maximum cardinality constraint. An efficient polynomial time (O(n4 log n)) solution is introduced.",

keywords = "Makespan, Minimum number of tardy jobs, Position-dependent processing times, Proportionate flowshop, Scheduling",

author = "Gur Mosheiov and Daniel Oron",

note = "Funding Information: The authors are grateful to the Associate Editor and the anonymous referees for their valuable feedback on an earlier version of the paper. The first author was supported by The Recanati Fund of The School of Business Administration, and The Charles Rosen Chair of Management, The Hebrew University, Jerusalem, Israel. ",

year = "2012",

month = jul,

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

language = "אנגלית",

volume = "39",

pages = "1601--1604",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier Ltd.",

number = "7",

}

TY - JOUR

T1 - Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times

AU - Mosheiov, Gur

AU - Oron, Daniel

N1 - Funding Information: The authors are grateful to the Associate Editor and the anonymous referees for their valuable feedback on an earlier version of the paper. The first author was supported by The Recanati Fund of The School of Business Administration, and The Charles Rosen Chair of Management, The Hebrew University, Jerusalem, Israel.

PY - 2012/7

Y1 - 2012/7

N2 - In various real life scheduling systems job processing times vary according to the number of jobs previously processed. The vast majority of studies assume a restrictive functional form to describe job processing times. In this note, we address a scheduling problem with the most general job processing time functions. The machine setting assumed is an m-machine proportionate flowshop, and the objective function is minimum number of tardy jobs. We show that the problem can be formulated as a bottleneck assignment problem with a maximum cardinality constraint. An efficient polynomial time (O(n4 log n)) solution is introduced.

AB - In various real life scheduling systems job processing times vary according to the number of jobs previously processed. The vast majority of studies assume a restrictive functional form to describe job processing times. In this note, we address a scheduling problem with the most general job processing time functions. The machine setting assumed is an m-machine proportionate flowshop, and the objective function is minimum number of tardy jobs. We show that the problem can be formulated as a bottleneck assignment problem with a maximum cardinality constraint. An efficient polynomial time (O(n4 log n)) solution is introduced.

KW - Makespan

KW - Minimum number of tardy jobs

KW - Position-dependent processing times

KW - Proportionate flowshop

KW - Scheduling

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

U2 - 10.1016/j.cor.2011.09.011

DO - 10.1016/j.cor.2011.09.011

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

AN - SCOPUS:81555219245

SN - 0305-0548

VL - 39

SP - 1601

EP - 1604

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 7

ER -

Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this