Investigation of the two-machine flow shop scheduling problem to minimize total energy costs with time-dependent energy prices

Amir Ebrahimzadeh Pilerood; Mehdi Heydari; Mohammad Mahdavi Mazdeh

Volume 5, Issue 2 , December 2018, , Pages 97-112

http://dx.doi.org/10.22116/jiems.2018.80687

Abstract
  In this paper, the problem of two-machine flow shop scheduling to minimize total energy costs under time-of-use tariffs is investigated. As the objective function of this study is not a regular measure, allowing intentional idle-time can be advantageous. So this study considers two approaches, one for ...  Read More

A Cuckoo search algorithm (CSA) for Precedence Constrained Sequencing Problem (PCSP)

Mansoureh Maadi; Mohammad Javidnia

Volume 4, Issue 2 , December 2017, , Pages 52-63

http://dx.doi.org/10.22116/jiems.2017.54606

Abstract
  Precedence constrained sequencing problem (PCSP) is related to locate the optimal sequence with the shortest traveling time among all feasible sequences. In PCSP, precedence relations determine sequence of traveling between any two nodes. Various methods and algorithms for effectively solving the PCSP ...  Read More