Scheduling on a two-machine permutation flow shop under time-of-use electricity tariffs

Abstract : We consider a two-machine permutation flow shop scheduling problem to minimise the total electricity cost of processing jobs under time-of-use electricity tariffs. We formulate the problem as a mixed integer linear programming, then we design two heuristic algorithms based on Johnson’s rule and dynamic programming method, respectively. In particular, we show how to find an optimal schedule using dynamic programming when the processing sequence is fixed. In addition, we propose an iterated local search algorithm to solve the problem with problem-tailored procedures and move operators, and test the computational performance of these methods on randomly generated instances.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01690495
Contributor : Frédéric Davesne <>
Submitted on : Tuesday, January 23, 2018 - 10:22:44 AM
Last modification on : Thursday, February 7, 2019 - 5:23:33 PM

Identifiers

Citation

Shijin Wang, Zhanguo Zhu, Kan Fang, Feng Chu, Chengbin Chu. Scheduling on a two-machine permutation flow shop under time-of-use electricity tariffs. International Journal of Production Research, Taylor & Francis, 2018, 56 (9), pp.3173--3187. ⟨10.1080/00207543.2017.1401236⟩. ⟨hal-01690495⟩

Share

Metrics

Record views

229