A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs
Year of publication: |
2020
|
---|---|
Authors: | Birgin, Ernesto Julian Goldberg ; Ferreira, J. E. ; Ronconi, D. P. |
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. 114.2020, p. 1-13
|
Subject: | Beam search | Common due date | Earliness and tardiness | Flowshop | Heuristics | Scheduling | Waiting time | Scheduling-Verfahren | Scheduling problem | Heuristik | Warteschlangentheorie | Queueing theory | Operations Research | Operations research | Durchlaufzeit | Lead time |
-
Minimizing total earliness and tardiness in a nowait flow shop
Schaller, Jeffrey, (2020)
-
Maassen, Kathrin, (2020)
-
Flowshop scheduling with a general exponential learning effect
Wang, Ji-bo, (2014)
- More ...
-
Birgin, Ernesto Julian Goldberg, (2015)
-
The multiperiod two‐dimensional non‐guillotine cutting stock problem with usable leftovers
Birgin, Ernesto Julian Goldberg, (2019)
-
Araujo, K. A. G., (2023)
- More ...