Multi-objective optimization of single machine scheduling with energy consumption constraints
- 1 November 2017
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2017 IEEE Symposium Series on Computational Intelligence (SSCI)
Abstract
A bi-objective single machine scheduling problem with energy consumption constraints is studied, in which the objective functions are the total weighted completion time and the total weighted tardiness. Given the NP-hard nature of the problem, a multi-objective particle swarm optimization (MOPSO) algorithm is adopted to solve the problem. Since the original version of the MOPSO was designed for continuous optimization problems, it is crucial to decode its results in order to obtain feasible schedules. After the algorithm framework is determined, key parameters of the MOPSO are analyzed. A design of experiments (DOE) approach based on the Taguchi method is used to optimize parameters of the MOPSO algorithm for both small-scale and large-scale problem instances. To assess the algorithm's performance, we compare it to a well-known multi-objective evolutionary algorithm, the NSGA-II. DOE analysis is also carried out for tuning the parameters of the NSGA-II. Comprehensive computational experiments with different performance measures confirm that the modified MOPSO performs well on both small-scale and large-scale instances tested, and its performance is often superior compared to the NSGA-II.Keywords
This publication has 17 references indexed in Scilit:
- Green scheduling of a two-machine flowshop: Trade-off between makespan and energy consumptionEuropean Journal of Operational Research, 2016
- Parallel Machine Scheduling Under Time-of-Use Electricity Prices: New Models and Optimization ApproachesIEEE Transactions on Automation Science and Engineering, 2015
- An investigation into minimising total energy consumption and total weighted tardiness in job shopsJournal of Cleaner Production, 2014
- Flow shop scheduling with peak power consumption constraintsAnnals of Operations Research, 2013
- A hybrid CP/MILP method for scheduling with energy costsEuropean J. of Industrial Engineering, 2011
- Electrical load tracking scheduling of a steel plantComputers & Chemical Engineering, 2010
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problemEuropean Journal of Operational Research, 2007
- Handling multiple objectives with particle swarm optimizationIEEE Transactions on Evolutionary Computation, 2004
- A discrete binary version of the particle swarm algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Minimizing Total Tardiness on One Machine is NP-HardMathematics of Operations Research, 1990