A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration
From MaRDI portal
Publication:833646
DOI10.1016/j.advengsoft.2009.03.018zbMath1177.90169MaRDI QIDQ833646
Fariborz Jolai, Jalil Layegh, Mohsen Sadegh Amalnik
Publication date: 14 August 2009
Published in: Advances in Engineering Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.advengsoft.2009.03.018
90B35: Deterministic scheduling theory in operations research
Related Items
A memetic algorithm for minimizing the total weighted completion time on a single machine under linear deterioration, Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs, A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs
Cites Work
- Unnamed Item
- Unnamed Item
- Determination of number of kanbans in a supply chain system via memetic algorithm
- Scheduling jobs under simple linear deterioration
- Single machine scheduling with start time dependent processing times: Some solvable cases
- A concise survey of scheduling with time-dependent processing times
- Single machine scheduling with deadlines and increasing rates of processing times
- Recent advances in memetic algorithms.
- Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs
- A note on single-processor scheduling with time-dependent execution times
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Scheduling with time dependent processing times: Review and extensions
- Makespan minimization in single-machine scheduling with step-deterioration of processing times
- A memetic algorithm for the total tardiness single machine scheduling problem
- Single machine scheduling with step-deteriorating processing times
