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

DOI10.1016/J.APM.2010.01.002MaRDI QIDQ611516zbMATH OpenOpenAlexFDO

Authors 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

linear deteriorationschedulingsingle machinetotal weighted completion time

Mathematics Subject Classification ID

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

Recommendations

• A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration
• Minimizing the total weighted completion time of deteriorating jobs
• Single-machine total completion time scheduling with a time-dependent deterioration
• Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
• scientific article; zbMATH DE number 5732213

Cites work

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

Cited in

(1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q611516)