Scheduling problems with two competing agents to minimized weighted earliness-tardiness
Year of publication: |
2013
|
---|---|
Authors: | Gerstl, Enrique ; 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. 40.2013, 1, p. 109-116
|
Subject: | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Branch-and-Bound | Branch and Bound | Heuristik | Heuristics |
-
Solution algorithms to minimise the total family tardiness for job shop scheduling with job families
Yu, Jae-Min, (2018)
-
Ozturk, Onur, (2017)
-
On the two-stage assembly flow shop problem
Hadda, Hatem, (2024)
- More ...
-
A two-stage flow shop batch-scheduling problem with the option of using Not-All-Machines
Gerstl, Enrique, (2013)
-
A two-stage flexible flow shop problem with unit-execution-time jobs and batching
Gerstl, Enrique, (2014)
-
Due-window assignment with identical jobs on parallel uniform machines
Gerstl, Enrique, (2013)
- More ...