A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration

Authors:
Jalil Layegh;Fariborz Jolai;Mohsen Sadegh Amalnik
Affiliations:
Department of Industrial Engineering, University College of Engineering, University of Tehran, Tehran, Iran;Department of Industrial Engineering, University College of Engineering, University of Tehran, Tehran, Iran;Department of Industrial Engineering, University College of Engineering, University of Tehran, Tehran, Iran
Venue:
Advances in Engineering Software
Year:
2009

Citing 11
Cited 1

A study of permutation crossover operators on the traveling salesman problem

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Single facility scheduling with nonlinear processing times

Computers and Industrial Engineering
Scheduling jobs under simple linear deterioration

Computers and Operations Research
Scheduling jobs with step-deterioration; minimizing makespan on a single- and multi-machine

Computers and Industrial Engineering
Single machine scheduling with deadlines and increasing rates of processing times

Acta Informatica
Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs

Computers and Operations Research
Fitness Landscapes, Memetic Algorithms, and Greedy Operators for Graph Bipartitioning

Evolutionary Computation
Determination of number of kanbans in a supply chain system via Memetic algorithm

Advances in Engineering Software
Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling

IEEE Transactions on Evolutionary Computation
Meta-Lamarckian learning in memetic algorithms

IEEE Transactions on Evolutionary Computation
A note on single-processor scheduling with time-dependent execution times

Operations Research Letters

Application of particle swarm optimization and simulated annealing algorithms in flow shop scheduling problem under linear deterioration

Advances in Engineering Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider minimizing total weighted completion time criteria on a single machine. Jobs processing times are step function of its starting time and all jobs have a common due date. First, we present some new lemmas and dominance properties for this NP-hard problem, and then a memetic algorithm using these properties is developed. We compare the solutions of the memetic algorithm with optimal solutions obtained from complete enumeration. The results show that the average percentage error of the proposed algorithm from optimal solutions is about 2% and as the variance of processing time increase, the percentage errors decrease.