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

Research output: Contribution to journalArticlepeer-review

13 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(n4 log n)) solution is introduced.

Original languageAmerican English
Pages (from-to)1601-1604
Number of pages4
JournalComputers and Operations Research
Volume39
Issue number7
DOIs
StatePublished - 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

Fingerprint

Dive into the research topics of 'Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times'. Together they form a unique fingerprint.

Cite this