Paint batching problem on M-to-1 conveyor systems
Year of publication: |
October 2016
|
---|---|
Authors: | Ko, Sung-Seok ; Han, Yong-Hee ; Choi, Jin Young |
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. 74.2016, p. 118-126
|
Subject: | Re-sequencing | Paint batching problem | M-to-1 conveyor system | Dynamic programming | Genetic algorithm | Setup minimization | Theorie | Theory | Evolutionärer Algorithmus | Evolutionary algorithm | Scheduling-Verfahren | Scheduling problem | Dynamische Optimierung | Mathematische Optimierung | Mathematical programming |
-
Metaheuristics for dynamic combinatorial optimization problems
Yang, Shengxiang, (2013)
-
Borisovsky, Pavel, (2020)
-
Exact exponential algorithms for 3-machine flowshop scheduling problems
Shang, Lei, (2018)
- More ...
-
Simulation-based two-phase genetic algorithm for the capacitated re-entrant line scheduling problem
Choi, Jin Young, (2009)
-
Simulation-based two-phase genetic algorithm for the capacitated re-entrant line scheduling problem
Choi, Jin Young, (2009)
-
Approximations of lead-time distributions in an assemble-to-order system under a base-stock policy
Ko, Sung-seok, (2011)
- More ...