Bicriteria scheduling for due date assignment with total weighted tardiness
| Autor: | Yixun Lin, Cheng He, Hao Lin |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Mathematical optimization
021103 operations research Computer science Tardiness 0211 other engineering and technologies 0102 computer and information sciences 02 engineering and technology Management Science and Operations Research Scheduling system 01 natural sciences Multi-objective optimization Polynomial algorithm Computer Science Applications Theoretical Computer Science Scheduling (computing) Due date 010201 computation theory & mathematics Linear combination |
| Zdroj: | RAIRO - Operations Research. 52:359-370 |
| ISSN: | 1290-3868 0399-0559 |
| DOI: | 10.1051/ro/2017074 |
| Popis: | In the due date assignment, the bicriteria scheduling models are motivated by the trade-off between the due date assignment cost and a performance criterion of the scheduling system. The bicriteria scheduling models related to the maximum tardiness and the weighted number of tardy jobs have been studied in the literature. In this paper we consider a new model with criteria of the due date assignment cost and the total weighted tardiness. The main results are polynomial-time algorithms for the linear combination version, the constraint version, and the Pareto optimization version of bicriteria scheduling. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|