Batch scheduling on uniform machines to minimize total flow-time
Year of publication: |
2012
|
---|---|
Authors: | Mor, Baruch ; Mosheiov, Gur |
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. 39.2012, 3, p. 571-575
|
Subject: | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Heuristik | Heuristics | Durchlaufzeit | Lead time |
-
Minimising total weighted earliness and tardiness on parallel machines using a hybrid heuristic
M'Hallah, Rym, (2012)
-
Effective meta-heuristics for scheduling on uninform machines with resource-dependent release dates
Li, Kai, (2015)
-
Batch scheduling on parallel machines with dynamic job arrivals and incompatible job families
Cakici, Eray, (2013)
- More ...
-
Total absolute deviation of job completion times on uniform and unrelated machines
Mor, Baruch, (2011)
-
Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
Mor, Baruch, (2010)
-
Single machine batch scheduling with two competing agents to minimize total flowtime
Mor, Baruch, (2011)
- More ...