Scheduling unit processing time jobs on an m-machine flow-shop

G. Mosheiov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

The sequential production of identical jobs and the flow-shop machine setting are extremely common in real-life applications. We study a scheduling problem that combines these two elements: jobs of identical processing time, with job-dependent weights, and a given common due date processed on an m-machine flow-shop. The (just-in-time) objective is to minimize the maximum earliness/tardiness cost. We introduce a polynomial time solution in both cases of (i) a non-restrictive (ie, sufficiently large) due date, and (ii) a restrictive due date (which restricts the number of early jobs).

Original languageAmerican English
Pages (from-to)437-441
Number of pages5
JournalJournal of the Operational Research Society
Volume54
Issue number4
DOIs
StatePublished - Apr 2003

Bibliographical note

Funding Information:
Acknowledgements—This paper was supported in part by the Recanati Fund of The School of Business Administration, The Hebrew University, Jerusalem, Israel.

Keywords

  • Flow-shop
  • Just-in-time
  • Scheduling

Fingerprint

Dive into the research topics of 'Scheduling unit processing time jobs on an m-machine flow-shop'. Together they form a unique fingerprint.

Cite this