Sequencing with Earliness and Tardiness Penalties: A Review

DOI Web Site 被引用文献3件

書誌事項

公開日
1990-02
DOI
  • 10.1287/opre.38.1.22
公開者
Institute for Operations Research and the Management Sciences (INFORMS)

この論文をさがす

説明

<jats:p> We consider the problem of scheduling n jobs to minimize the total earliness and tardiness penalty. We review the literature on this topic, providing a framework to show how results have been generalized starting with a basic model that contains symmetric penalties, one machine and a common due date. To this base we add such features as parallel machines, complex penalty functions and distinct due dates. We also consolidate many of the existing results by proving general forms of two key properties of earliness/tardiness models. </jats:p>

収録刊行物

  • Operations Research

    Operations Research 38 (1), 22-36, 1990-02

    Institute for Operations Research and the Management Sciences (INFORMS)

被引用文献 (3)*注記

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ