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

Layegh, Jalil; Jolai, Fariborz; Amalnik, Mohsen Sadegh

doi:10.1016/j.advengsoft.2009.03.018

Cited by 19 publications

(8 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Generate a random task sequence for candidate tasks assigned to (10) end for (11) Calculate the objective value ( ,TQ) with the evaluation function ( ) (see they will be determined by same methods in Section 4.3.…”

Section: The Crossover Operatormentioning

confidence: 99%

“…With MA, the traits of Universal Darwinism are more appropriately captured, in particular dealing with areas of evolutionary algorithms that marry other deterministic refinement techniques for solving optimization problems [10]. As a general framework, MA provides the search with desirable trade-off between intensification and diversification through the combined use of a crossover operator to generate new promising solutions and a local optimization procedure to locally improve the generated solutions [11,12].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Memetic Algorithm for Multiskill Resource‐Constrained Project Scheduling Problem under Linear Deterioration

Dai

2019

Mathematical Problems in Engineering

View full text Add to dashboard Cite

This paper proposes a general variable neighborhood search-based memetic algorithm (GVNS-MA) for solving the multiskill resource-constrained project scheduling problem under linear deterioration. Integrating a solution recombination operator and a local optimization procedure, the proposed GVNS-MA is assessed on two sets of instances and achieves highly competitive results. One set of benchmark instances is commonly used in the literature where the capability of the proposed algorithm to find high quality solutions is demonstrated, compared with the state-of-the-art algorithms in the literature. The other set revises the former through incorporating the linear deterioration effect. Two key components of the proposed algorithm are investigated to confirm their critical role to the success of the proposed method.

show abstract

Section: The Crossover Operatormentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Memetic Algorithm for Multiskill Resource‐Constrained Project Scheduling Problem under Linear Deterioration

Dai

2019

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…They derived a MILP model to solve the problem optimally and proposed a hybrid genetic algorithm to obtain a nearoptimal solution. Layegh et al [28] addressed minimizing total weighted completion time on a single machine under piecewise linear deterioration. They proposed the memetic algorithm using dominance properties that the average percentage error of the algorithm from optimal solutions is about 2%.…”

Section: Introductionmentioning

confidence: 99%

Scheduling Piecewise Linear Deteriorating Jobs to Minimize Makespan in a Two-Machine Flowshop

et al. 2021

View full text Add to dashboard Cite

“…Jeng and Lin [6] introduced a Branch-and-Bound algorithm for this problem, which can solve instances of up to 100 jobs efficiently. Layegh et al [8] studied the total weighted completion time problem under step-deterioration, and proposed a memetic algorithm (a type of genetic algorithm) with average optimality gap of 2%. For scheduling problems with general job deterioration, we refer the reader to the recent book of Gawiejnowicz [4].…”

Section: Introductionmentioning

confidence: 99%

Batch scheduling with step‐deteriorating processing times to minimize flowtime

Mor

Mosheiov

2012

Naval Research Logistics

View full text Add to dashboard Cite

Both topics of batch scheduling and of scheduling deteriorating jobs have been very popular among researchers in the last two decades. In this article, we study a model combining these two topics. We consider a classical batch scheduling model with unit‐jobs and batch‐independent setup times, and a model of step‐deterioration of processing times. The objective function is minimum flowtime. The optimal solution of the relaxed version (allowing non‐integer batch sizes) is shown to have a unique structure consisting of two consecutive decreasing arithmetic sequences of batch sizes. We also introduce a simple and efficient rounding procedure that guarantees integer batch sizes. The entire solution procedure requires an effort of O(n) (where nis the number of jobs.) © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012

show abstract

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

Cited by 19 publications

References 22 publications

A Memetic Algorithm for Multiskill Resource‐Constrained Project Scheduling Problem under Linear Deterioration

A Memetic Algorithm for Multiskill Resource‐Constrained Project Scheduling Problem under Linear Deterioration

Scheduling Piecewise Linear Deteriorating Jobs to Minimize Makespan in a Two-Machine Flowshop

Batch scheduling with step‐deteriorating processing times to minimize flowtime

Contact Info

Product

Resources

About