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

作者：Wang, Shijin; Zhu, Zhanguo; Fang, Kan; Chu, Feng; Chu, Chengbin^*

来源：International Journal of Production Research, 2018, 56(9): 3173-3187.

DOI：10.1080/00207543.2017.1401236

• scheduling
• flow shop
• electricity cost
• dynamic programming
• iterated local search

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.

• 出版日期2018
• 单位南京农业大学; 西华大学; 同济大学; 天津大学