A TWO-STAGE GREEDY HEURISTIC FOR A FLOWSHOP SCHEDULING PROBLEM UNDER TIME-OF-USE ELECTRICITY TARIFFS

Authors

  • Amir Ebrahimzadeh Pilerood Department of Industrial Engineering, Iran University of Science and Technology, Islamic Republic of Iran
  • Mehdi Heydari Department of Industrial Engineering, Iran University of Science and Technology, Islamic Republic of Iran
  • Mohammad Mahdavi Mazdeh Department of Industrial Engineering, Iran University of Science and Technology, Islamic Republic of Iran

DOI:

https://doi.org/10.7166/29-1-1898

Keywords:

Scheduling, flowshop, mathematical modeling, heuristic algorithm, energy

Abstract

This paper studies a two-machine flowshop scheduling problem under time-dependent electricity tariffs, in which electricity prices may vary from time to time throughout the day. The main issue is to assign a set of jobs to available time slots with different electricity prices to minimise the total resource cost required for processing the jobs. The main contribution of this work is two-fold. First, a new continuous-time mixed-integer linear programming (MILP) model is proposed for the problem. Second, a two-stage greedy heuristic is developed. A computational experiment on randomly generated instances demonstrates that the greedy algorithm can improve the objective function by almost 40 percent. The algorithm can be applied by production managers to scheduling jobs in a flowshop under time-of-use (TOU) electricity tariffs to save electricity costs.

Downloads

Published

2018-05-31

How to Cite

Pilerood, A. E., Heydari, M., & Mahdavi Mazdeh, M. (2018). A TWO-STAGE GREEDY HEURISTIC FOR A FLOWSHOP SCHEDULING PROBLEM UNDER TIME-OF-USE ELECTRICITY TARIFFS. The South African Journal of Industrial Engineering, 29(1), 143–154. https://doi.org/10.7166/29-1-1898

Issue

Vol. 29 No. 1 (2018)

Section

General Articles

License

Authors who publish in the Journal agree to the following terms:
  1. Authors retain copyright and grant the Journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this Journal.
  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the Journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this Journal.