Scheduling on a two-machine permutation flow shop under time-of-use electricity tariffs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Production Research Année : 2018

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

Kan Fang
  • Fonction : Auteur
Chengbin Chu

Résumé

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.
Fichier principal
Vignette du fichier
Wang2018p.pdf (293.82 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01690495 , version 1 (25-02-2024)

Identifiants

Citer

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, 2018, 56 (9), pp.3173--3187. ⟨10.1080/00207543.2017.1401236⟩. ⟨hal-01690495⟩
228 Consultations
2 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More