Original paper
Scheduling on a two-machine permutation flow shop under time-of-use electricity tariffs
Volume: 56, Issue: 9, Pages: 3173 - 3187
Published: Nov 23, 2017
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...
Figures & Tables
Table 1. Comparison of running time and number of optimal solutions solved betwe...
Figure 1. Electricity market price for industry during the non-summer time in Sh...
Figure 2. Gantt chart for Example 4.1.
Table 2. Comparison of optimality gap between Algorithm JR and Algorithm ILS.
Table 3. Comparison of computational performance of Algorithms ILS, DP11 and ILS...
Figure 3. Gantt chart for the schedule after performing Swap(3,1) on s in Exampl...
Paper Details
Title
Scheduling on a two-machine permutation flow shop under time-of-use electricity tariffs
Published Date
Nov 23, 2017
Volume
56
Issue
9
Pages
3173 - 3187
Citation AnalysisPro
You’ll need to upgrade your plan to Pro
Looking to understand the true influence of a researcher’s work across journals & affiliations?
- Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
- Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.