Iterated greedy with random variable neighborhood descent for scheduling jobs on parallel machines with deterioration effect

DOI10.1016/J.ENDM.2017.03.008zbMath1387.90081OpenAlexW2606962913MaRDI QIDQ1687634

Vívian L. Aguiar Santos, José Elias Claudio Arroyo

Publication date: 4 January 2018

Full work available at URL: http://www.locus.ufv.br/handle/123456789/21699

zbMATH Keywords

schedulingunrelated parallel machinesvariable neighborhood descentiterated greedydeterioration effect

Mathematics Subject Classification ID

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

Related Items (1)

Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events

Cites Work

• Unnamed Item
• Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects
• Parallel-machine scheduling of simple linear deteriorating jobs
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• Variable neighbourhood search: Methods and applications
• Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities
• Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs
• Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time

This page was built for publication: Iterated greedy with random variable neighborhood descent for scheduling jobs on parallel machines with deterioration effect