Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria
Year of publication: |
2014
|
---|---|
Authors: | Gawiejnowicz, Stanisław ; Suwalski, Cezary |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 52.2014, A, p. 135-146
|
Subject: | Agent scheduling | Deteriorating jobs | Total weighted completion time | Maximum lateness | NP-hardness | Algorithms | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm | Branch-and-Bound | Branch and Bound | Heuristik | Heuristics |
-
A combined approach for two-agent scheduling with sum-of-processing-times-based learning effect
Wu, Wen-Hung, (2016)
-
An exact algorithm for the preemptive single machine scheduling of equal-length jobs
Fomin, Artem, (2022)
-
An exact algorithm for the single machine problem with unavailability periods
Gharbi, Anis, (2015)
- More ...
-
Scheduling deteriorating jobs subject to job or machine availability constraints
Gawiejnowicz, Stanisław, (2007)
-
Equivalent time-dependent scheduling problems
Gawiejnowicz, Stanisław, (2009)
-
Post-objective determination of weights of the evaluation factors in public procurement tenders
Gawiejnowicz, Stanisław, (2010)
- More ...