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

DOI10.1016/j.apm.2010.01.002zbMath1201.90078OpenAlexW2091765017MaRDI QIDQ611516

Jalil Layegh, Fariborz Jolai

Publication date: 14 December 2010

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2010.01.002

zbMATH Keywords

schedulingsingle machinetotal weighted completion timelinear deterioration

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration
• Time-dependent scheduling
• Multi-objective memetic algorithms
• Single machine parallel-batch scheduling with deteriorating jobs
• Conjugate problems in time-dependent scheduling
• Equivalent time-dependent scheduling problems
• Scheduling jobs under simple linear deterioration
• Single machine scheduling with start time dependent processing times: Some solvable cases
• Minimizing the total weighted completion time of deteriorating jobs
• Pareto and scalar bicriterion optimization in scheduling deteriorating jobs
• Scheduling start time dependent jobs to minimize the total weighted completion time
• Λ-Shaped Policies to Schedule Deteriorating Jobs
• Handbook of metaheuristics
• A memetic algorithm for the total tardiness single machine scheduling problem

This page was built for publication: A memetic algorithm for minimizing the total weighted completion time on a single machine under linear deterioration