An Energy-Aware Multiobjective Optimization Framework to Minimize Total Tardiness and Energy Cost on a Single-Machine Nonpreemptive Scheduling


Rubaiee S., Cinar S., Yildirim M. B.

IEEE TRANSACTIONS ON ENGINEERING MANAGEMENT, cilt.66, sa.4, ss.699-714, 2019 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 66 Sayı: 4
  • Basım Tarihi: 2019
  • Doi Numarası: 10.1109/tem.2018.2846627
  • Dergi Adı: IEEE TRANSACTIONS ON ENGINEERING MANAGEMENT
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Social Sciences Citation Index (SSCI), Scopus
  • Sayfa Sayıları: ss.699-714
  • İstanbul Teknik Üniversitesi Adresli: Evet

Özet

Energy-aware scheduling in a manufacturing environment with real-time energy pricing is a challenging problem. The purpose of this paper is to study a nonpreemptive scheduling problem on a single-machine to minimize the total tardiness and total energy cost under time-of-use electricity tariffs, which is a mixed-integer multi-objective mathematical programming model. To achieve these objectives, we develop several new holistic genetic algorithms. The proposed model is solved via several methods including weighted sum method and multiobjective genetic algorithms based on dominance rank (GA-1), weighted sum aggregation (GA-2), dominance ranking procedure and crowding distance comparison (GA-3), and heuristic approach (GA-H). This paper illustrates that operations management, which is typically observed as a significant technique that allows manufacturing to operate in challenging data enabled environment in an industrial internet of things ecosystem, can also carefully optimize a production process to improve energy cost in order to manage environmental challenges. Thus, the findings provide information on when to start each job. We provide detailed experimental results evaluating the performance of the proposed algorithms. In a case study, we illustrate how the results of the multiobjective model could be utilized in decision making using the technique for order preference by similarity to ideal solution method.