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

Amir Ebrahimzadeh Pilerood, Mehdi Heydari, Mohammad Mahdavi Mazdeh

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.


Keywords


Scheduling; flowshop; mathematical modeling; heuristic algorithm; energy

Full Text:

PDF


DOI: http://dx.doi.org/10.7166/29-1-1898

Refbacks

  • There are currently no refbacks.




Copyright (c) 2018 Amir Ebrahimzadeh Pilerood, Mehdi Heydari, Mohammad Mahdavi Mazdeh


ISSN 2224-7890 (on-line) ; ISSN 1012-277X (print)


Powered by OJS and hosted by Stellenbosch University Library and Information Service since 2011.


Disclaimer:

This journal is hosted by the SU LIS on request of the journal owner/editor. The SU LIS takes no responsibility for the content published within this journal, and disclaim all liability arising out of the use of or inability to use the information contained herein. We assume no responsibility, and shall not be liable for any breaches of agreement with other publishers/hosts.

SUNJournals Help