Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects
From MaRDI portal
Publication:336434
DOI10.1016/j.cor.2013.02.018zbMath1348.90307OpenAlexW1969272802MaRDI QIDQ336434
Alex J. Ruiz-Torres, Giuseppe Paletta, Eduardo B. Perez
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.02.018
multiprocessor schedulingunrelated parallel machinesmachine and job deteriorationsimulated annealing meta-heuristic
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (12)
Algorithms for single-machine scheduling problem with deterioration depending on a novel model ⋮ Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration ⋮ A comparison of mixed-integer linear programming models for workforce scheduling with position-dependent processing times ⋮ Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan ⋮ A hybrid differential evolution approach based on surrogate modelling for scheduling bottleneck stages ⋮ A new approach based on the learning effect for sequence-dependent parallel machine scheduling problem under uncertainty ⋮ Iterated greedy with random variable neighborhood descent for scheduling jobs on parallel machines with deterioration effect ⋮ Two-stage assembly scheduling with batch setup times, time-dependent deterioration, and preventive maintenance activities using meta-heuristic algorithms ⋮ Scheduling semiconductor multihead testers using metaheuristic techniques embedded with lot-specific and configuration-specific information ⋮ Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events ⋮ Flow shop scheduling problem with position-dependent processing times ⋮ A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times
Cites Work
- Unnamed Item
- Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time
- Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties
- Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
- Parallel-machine scheduling of simple linear deteriorating jobs
- Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs
- Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration
- A concise survey of scheduling with time-dependent processing times
- Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities
- Parallel-machine scheduling with simple linear deterioration to minimize total completion time
- Parallel-machine scheduling with time dependent processing times
- Scheduling with time dependent processing times: Review and extensions
- Scheduling Deteriorating Jobs on a Single Processor
- An approximation algorithm for parallel machine scheduling with simple linear deterioration
- Handbook of metaheuristics
This page was built for publication: Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects