A multi-criteria scheduling with due-window assignment problem

Gur Mosheiov*, Assaf Sarig

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

We study a multi-criteria scheduling and due-window assignment problem, in which the cost components are: flow-time, earliness, tardiness and due-window cost. Jobs completed within the due-window are assumed to be on time, and no earliness{set minus}tardiness cost is incurred. The due-window starting time is a given parameter, whereas the due-window completion time (i.e., the window size) is determined during sales negotiations with the customer, and is therefore a decision variable. The problem is shown to be solved (finding both the schedule and the due-window size) in polynomial time.

Original languageAmerican English
Pages (from-to)898-907
Number of pages10
JournalMathematical and Computer Modelling
Volume48
Issue number5-6
DOIs
StatePublished - Sep 2008

Bibliographical note

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

Keywords

  • Due-window
  • Earliness-tardiness
  • Flow-time
  • Multi-criteria
  • Scheduling

Fingerprint

Dive into the research topics of 'A multi-criteria scheduling with due-window assignment problem'. Together they form a unique fingerprint.

Cite this