Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Pisut Pongchairerks"'
Autor:
Pisut Pongchairerks
Publikováno v:
Complexity, Vol 2022 (2022)
This paper proposes a two-level metaheuristic consisting of lower- and upper-level algorithms for the job-shop scheduling problem with multipurpose machines. The lower-level algorithm is a local search algorithm used for finding an optimal solution.
Externí odkaz:
https://doaj.org/article/8df2fd7681b449dfb666c38ba69b81d0
Autor:
Pisut Pongchairerks
Publikováno v:
Complexity, Vol 2021 (2021)
This paper introduces a job-shop scheduling problem (JSP) with bidirectional circular precedence constraints, called BCJSP. In the problem, each job can be started from any operation and continued by its remaining operations in a circular precedence-
Externí odkaz:
https://doaj.org/article/7c095aa3cccf4e8a9fc5af3bd922bbec
Autor:
Pisut Pongchairerks
Publikováno v:
Complexity, Vol 2020 (2020)
For solving the job-shop scheduling problem (JSP), this paper proposes a novel two-level metaheuristic algorithm, where its upper-level algorithm controls the input parameters of its lower-level algorithm. The lower-level algorithm is a local search
Externí odkaz:
https://doaj.org/article/c7046ac0ca234301af3aea0f38d89c95
Autor:
Pisut Pongchairerks
Publikováno v:
Complexity, Vol 2019 (2019)
This paper proposes a novel two-level metaheuristic algorithm, consisting of an upper-level algorithm and a lower-level algorithm, for the job-shop scheduling problem (JSP). The upper-level algorithm is a novel population-based algorithm developed to
Externí odkaz:
https://doaj.org/article/1fecb1ffc259438f9676ac7aa0da0143
Autor:
Pisut Pongchairerks
Publikováno v:
Modelling and Simulation in Engineering, Vol 2016 (2016)
This paper proposes a number of forward VNS and reverse VNS algorithms for job-shop scheduling problem. The forward VNS algorithms are the variable neighborhood search algorithms applied to the original problem (i.e., the problem instance with the or
Externí odkaz:
https://doaj.org/article/ad276906cede4756b897d2ac28c823f2
Autor:
Pisut Pongchairerks
Publikováno v:
Sustainability
Volume 15
Issue 5
Pages: 4289
Volume 15
Issue 5
Pages: 4289
This paper proposes a probabilistic hill-climbing algorithm, called PH, for the single-source transportation problem (STP). PH is a tree search algorithm in which each node contains an assignment problem (AP) transformed from the STP being solved. Th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bcc5b6cfb095c49a54026e86dbbcc38a
https://doi.org/10.3390/su15054289
https://doi.org/10.3390/su15054289
Autor:
Pisut Pongchairerks
Linear Programming is my book published in a hard-copy version on 2017. This book has been used to teach my Thai students in Operations Research subject since then. Thus, it is in Thai language.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa34cd8d48979a0df43646965d85075a
Autor:
Pisut Pongchairerks
Publikováno v:
International Journal of Applied Physics and Mathematics. 4:352-362
This paper develops two efficient heuristics to solve the single-source transportation problem, i.e. the special class of the transportation problem where each customer must be served by only one supplier. The proposed heuristics are both started by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a617ec5d1bc74eea815044c85615482
https://doi.org/10.7763/ijapm.2014.v4.308
https://doi.org/10.7763/ijapm.2014.v4.308
Publikováno v:
Asia-Pacific Journal of Operational Research. 26:161-184
This paper is a contribution to the research which aims to provide an efficient optimization algorithm for job-shop scheduling problems with multi-purpose machines or MPMJSP. To meet its objective, this paper proposes a new variant of particle swarm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::463881bc5aa7ab6956f155b6891df55f
https://doi.org/10.1142/s0217595909002158
https://doi.org/10.1142/s0217595909002158
Publikováno v:
2015 International Conference on Science and Technology (TICST).
To efficiently solve the assembly line balancing problems in the production lines of a Japanese manufacturer of digital rice cookers, the research in this paper proposes three assembly line balancing algorithms extended from the well-known algorithms
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e9ce553be507a6673982be9f74518fd
https://doi.org/10.1109/ticst.2015.7369396
https://doi.org/10.1109/ticst.2015.7369396