Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
Long Wan, Jiajie Mei, Jiangze Du
Year of publication: |
2021
|
---|---|
Authors: | Wan, Long ; Mei, Jiajie ; Du, Jiangze |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 290.2021, 1 (1.4.), p. 26-35
|
Subject: | Two-agent sceduling | Completion time | Tardy job | NP-completeness | FPTAS | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Theorie | Theory | Heuristik | Heuristics | Terminplanung | Time scheduling |
Saved in:
Online Resource
Saved in favorites
Similar items by subject
-
Maximizing the minimum completion time on parallel machines
Haouari, Mohamed, (2008)
-
Comparing the minimum completion times of two longest-first scheduling-heuristics
Walter, Rico, (2010)
-
Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times
Uzsoy, Reha, (2008)
- More ...
Similar items by person