Competitive bi-agent flowshop scheduling to minimise the weighted combination of makespans
Year of publication: |
2022
|
---|---|
Authors: | Bai, Danyu ; Diabat, Ali ; Wang, Xinyue ; Yang, Dandan ; Fu, Yao ; Zhang, Zhi-Hai ; Wu, Chin-Chia |
Published in: |
International journal of production research. - London [u.a.] : Taylor & Francis, ISSN 1366-588X, ZDB-ID 1485085-0. - Vol. 60.2022, 22, p. 6750-6771
|
Subject: | asymptotic analysis | Bi-agent scheduling | branch and bound | discrete artificial bee colony | flow shop scheduling | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Theorie | Theory | Heuristik | Heuristics | Branch-and-Bound | Branch and Bound |
-
Ozturk, Onur, (2017)
-
Makespan minimization on a two-machine flowshop with an availability constraint on the first machine
Hnaien, Faicel, (2015)
-
Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness
Mensendiek, Arne, (2015)
- More ...
-
Scheduling a multi-agent flow shop with two scenarios and release dates
Wang, Xinyue, (2024)
-
Flexible open shop scheduling problem to minimize makespan
Bai, Danyu, (2016)
-
Flow shop learning effect scheduling problem with release dates
Bai, Danyu, (2018)
- More ...