Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs
From MaRDI portal
Publication:1955358
DOI10.1155/2012/928312zbMath1264.90086OpenAlexW2169061120WikidataQ58912692 ScholiaQ58912692MaRDI QIDQ1955358
Wenming Cheng, Ming Zeng, Zeqiang Zhang, Peng Guo, Jian Liang
Publication date: 11 June 2013
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/928312
Related Items (9)
Modeling the parallel machine scheduling problem with step deteriorating jobs ⋮ Iterated greedy with random variable neighborhood descent for scheduling jobs on parallel machines with deterioration effect ⋮ A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs ⋮ Single-machine group scheduling problems with deterioration to minimize the sum of completion times ⋮ Variable neighbourhood search and mathematical programming for just-in-time job-shop scheduling problem ⋮ A linear time complexity of breadth-first search using P system with membrane division ⋮ A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time ⋮ An improved discrete artificial bee colony algorithm for flexible flowshop scheduling with step deteriorating jobs and sequence-dependent setup times ⋮ Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
Cites Work
- Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties
- Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties
- Single machine quadratic penalty function scheduling with deteriorating jobs and group technology
- Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
- Single-machine due-window assignment problem with learning effect and deteriorating jobs
- Single-machine scheduling with nonlinear deterioration
- A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration
- Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
- Variable neighbourhood search: methods and applications
- Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs
- Single machine scheduling with start time dependent processing times: Some solvable cases
- A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
- A concise survey of scheduling with time-dependent processing times
- Minimizing the total weighted completion time of deteriorating jobs
- Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs
- A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
- Algorithms for single machine total tardiness scheduling with sequence dependent setups
- Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
- 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
- Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs
- A variable neighbourhood search algorithm for the flexible job-shop scheduling problem
- Dynamic job shop scheduling using variable neighbourhood search
- Scheduling Deteriorating Jobs on a Single Processor
- Variable neighborhood search for the p-median
- Scheduling deteriorating jobs to minimize makespan
- Scheduling jobs with piecewise linear decreasing processing times
- Makespan minimization in single-machine scheduling with step-deterioration of processing times
- Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
- Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs
- Scheduling
- Minimizing maximum lateness under linear deterioration
- Variable neighborhood search: Principles and applications
- Single machine scheduling with step-deteriorating processing times
This page was built for publication: Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs
