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.018zbMATH Open1177.90169OpenAlexW1968565359MaRDI QIDQ833646FDOQ833646
Authors: Jalil Layegh, Fariborz Jolai, 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
Recommendations
- A memetic algorithm for minimizing the total weighted completion time on a single machine under linear deterioration
- Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs
- Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs
- Minimizing the total weighted completion time of deteriorating jobs
- Makespan minimization in single-machine scheduling with step-deterioration of processing times
Cites Work
- Title not available (Why is that?)
- Single machine scheduling with deadlines and increasing rates of processing times
- A memetic algorithm for the total tardiness single machine scheduling problem
- Recent advances in memetic algorithms.
- Single machine scheduling with start time dependent processing times: Some solvable cases
- A concise survey of scheduling with time-dependent processing times
- Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs
- Scheduling with time dependent processing times: Review and extensions
- Makespan minimization in single-machine scheduling with step-deterioration of processing times
- Single machine scheduling with step-deteriorating processing times
- Scheduling jobs under simple linear deterioration
- 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 deteriorating jobs to minimize makespan
- Determination of number of kanbans in a supply chain system via memetic algorithm
Cited In (7)
- Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop
- Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs
- Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration
- A memetic algorithm for minimizing the total weighted completion time on a single machine under linear deterioration
- Modeling the parallel machine scheduling problem with step deteriorating jobs
- 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
This page was built for publication: A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833646)
