A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups
From MaRDI portal
Publication:1761169
DOI10.1016/j.cor.2011.12.014zbMath1251.90008MaRDI QIDQ1761169
Mario Vanhoucke, Veronique Sels
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.12.014
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
90-08: Computational methods for problems pertaining to operations research and mathematical programming
90-04: Software, source code, etc. for problems pertaining to operations research and mathematical programming
Related Items
A hybrid vendor managed inventory and redundancy allocation optimization problem in supply chain management: an NSGA-II with tuned parameters, ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness, Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times, A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups, Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness
Cites Work
- Unnamed Item
- Unnamed Item
- Theoretical aspects of local search.
- Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
- Single machine batch scheduling problem with family setup times and release dates to minimize makespan
- Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem
- A simulated annealing algorithm for single machine scheduling problems with family setups
- Scheduling in a sequence dependent setup environment with genetic search
- Batch scheduling to minimize maximum lateness
- Single machine scheduling with batch set-up times to minimize maximum lateness
- Minimizing maximum lateness with job families
- A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups
- Scheduling with batching: A review
- Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times
- The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard
- A survey of scheduling problems with setup times or costs
- Experimental testing of advanced scatter search designs for global optimization of multimodal functions
- Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
- On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- On the Complexity of Scheduling with Batch Setup Times
- Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times
- Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
- Genetic Algorithms
- Minimizing L max for the single machine scheduling problem with family set-ups
- Scheduling Groups of Jobs on a Single Machine
