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

Shijin Wang; Zhanguo Zhu; Kan Fang; Feng Chu; Chengbin Chu

doi:10.1080/00207543.2017.1401236

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

Shijin Wang ¹ Zhanguo Zhu ² Kan Fang Feng Chu ³ Chengbin Chu ⁴

1 Department of Management Science and Engineering

2 College of Economics and Management

3 IBISC - Informatique, Biologie Intégrative et Systèmes Complexes

4 ESIEE Paris

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.

Keywords : scheduling flow shop electricity cost dynamic programming iterated local search

Document type :

Journal articles

Domain :

Computer Science [cs] / Operations Research [cs.RO]

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

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

Identifiers

Collections

Citation

Export

Metrics

229

Contact

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

Identifiers

Collections

Citation

Export

Share

Metrics

229

Contact