Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities
From MaRDI portal
Publication:1652634
DOI10.1016/j.cor.2018.02.017zbMath1458.90373OpenAlexW2789275134MaRDI QIDQ1652634
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.02.017
schedulingmixed integer linear programmingmetaheuristicdeteriorationrate-modifying activitymatheuristic
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Improved DE search for competing groups scheduling with deterioration effects, Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration, Effects of OCRA parameters and learning rate on machine scheduling, Heuristics for flights arrival scheduling at airports, Two-agent single-machine scheduling with a rate-modifying activity, An optimization method for characterizing two groups of data, Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop, Matheuristics for a parallel machine scheduling problem with non-anticipatory family setup times: application in the offshore oil and gas industry, A matheuristic for parallel machine scheduling with tool replacements, Production, maintenance and resource scheduling: a review
Uses Software
Cites Work
- An effective matheuristic for the capacitated total quantity discount problem
- Single-machine total completion time scheduling with a time-dependent deterioration
- Unrelated parallel-machine scheduling with deterioration effects and deteriorating multi-maintenance activities for minimizing the total completion time
- A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine
- Two-parallel machines scheduling with rate-modifying activities to minimize total completion time
- A concise survey of scheduling with time-dependent processing times
- Machine scheduling with a rate-modifying activity
- Minimizing the total weighted completion time of deteriorating jobs
- Scheduling deteriorating jobs with a learning effect on unrelated parallel machines
- An exact algorithm for the capacitated total quantity discount problem
- Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder
- Unrelated parallel-machine scheduling problems with multiple rate-modifying activities
- Parallel-machine scheduling with simple linear deterioration to minimize total completion time
- A hybrid genetic algorithm for multiobjective problems with activity analysis-based local search
- A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem
- Scheduling with time dependent processing times: Review and extensions
- Scheduling Deteriorating Jobs on a Single Processor
- ParamILS: An Automatic Algorithm Configuration Framework
- Bounds on Multiprocessing Timing Anomalies
- Single machine scheduling with step-deteriorating processing times
