Dynamic programming approach for solving the open shop problem
Sign Up to like & getrecommendations! Published in 2021 at "Central European Journal of Operations Research"
DOI: 10.1007/s10100-019-00630-3
Abstract: This paper deals with the open shop scheduling problem (OSP) with makespan minimization. An exact dynamic programming algorithm is proposed for solving the OSP to optimality. This approach is applied to the OSP for the… read more here.
Keywords: dynamic programming; approach; problem; open shop ... See more keywords
An hybrid SA-DATC Approach for JIT Open-Shop Scheduling Problem with Earliness and Tardiness Penalties
Sign Up to like & getrecommendations! Published in 2019 at "IFAC-PapersOnLine"
DOI: 10.1016/j.ifacol.2019.11.565
Abstract: Abstract In this paper, we propose an innovative hybrid integrated approach between simulated annealing (SA) and control theoretic based distributed arrival time control (DATC), named SA-DATC. The two approaches have been combined to achieve the… read more here.
Keywords: open shop; hybrid datc; datc approach; approach ... See more keywords
A two-level particle swarm optimisation algorithm for open-shop scheduling problem
Sign Up to like & getrecommendations! Published in 2017 at "International Journal of Computing"
DOI: 10.1504/ijcsm.2016.081693
Abstract: This paper proposes a two-level PSO algorithm for open-shop scheduling problem. In this algorithm, the upper-level PSO algorithm fine-tunes the parameter values for the lower-level PSO algorithm; the lower-level PSO algorithm then uses the given… read more here.
Keywords: two level; open shop; shop scheduling; scheduling problem ... See more keywords