scholarly journals A Comparative Analysis of Job Scheduling for Optimum Performance of Parallel Machines by Considering the Energy Consumption

Author(s):  
Maurizio Faccio ◽  
Mojtaba Nedaei ◽  
Francesco Pilati

In this study, a comparative analysis of scheduling of machines and jobs was conducted by proposing a method, which aims to optimize the performance of the job-shop environment. A wide range of objective functions including make-span, maximum tardiness, total flow time, total tardiness, total weighted flow time, and total weighted tardiness, and energy consumption. The decision variables of a manufacturing company including the job’s weight, stating and completion time, due dates, releasing date, and processing time were considered as inputs of the optimization model. Then, subject to the defined technical constraints of the system, a comparative analysis on the basis of eight scheduling methods was conducted to assess the performance indicators of the job-shop system. Results of the analysis revealed variations of different objective functions based on the proposed methods. The optimum make-span varied from minimum of 210 days estimated by the Earliest Due Date (EDD) method, up to 222 days estimated by the Critical Ratio (CR) method. Further recommendations were also made for optimum values of the involved decision variables in the considered job-shop environment. Results revealed that the maximum tardiness was best optimized using the EDD method, whilst the Shortest Processing Time (SPT) led to the best optimum value for the total flow time. Analysis of the energy evaluation of the machines showed that the optimum overall energy consumption has been observed with the value of 7,934 kWh for the first operating machine under the effect of the Minimum Slack method, whilst the optimum energy consumption for the second machine was observed with the value of 7,968 kWh using the First Come First Served (FCFS). Last stage of study recommended the optimum planning schedules and resource allocations of the jobs in the machines considering each scheduling method during the operation of the designed job-shop.

2016 ◽  
Vol 8 (3) ◽  
pp. 1
Author(s):  
Ali Musaddak Delphi

<p>In this paper, we proposed three heuristic algorithms to solve multiobjective transportation problems, the first heuristic algorithm used to minimize two objective functions (total flow time and total late work), the second one used to minimize two objective functions (total flow time and total tardiness) and the last one used to minimize three objective functions (total flow time, total late work and total tardiness), where these heuristic algorithms which is different from to another existing algorithms and providing the support to decision markers for handing time oriented problems.</p>


2019 ◽  
Vol 81 ◽  
pp. 105480 ◽  
Author(s):  
Guanlong Deng ◽  
Zhiwang Zhang ◽  
Tianhua Jiang ◽  
Shuning Zhang

Sign in / Sign up

Export Citation Format

Share Document