An improved genetic algorithm for single-machine inverse scheduling problem

DOI10.1155/2014/370560zbMath1407.90369OpenAlexW2154352383WikidataQ59064731 ScholiaQ59064731MaRDI QIDQ1718215

Chao Lu, Xinyu Li, Liang Gao, Jianhui Mou, Guo-Hui Zhang

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/370560

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
• Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
• Minimizing the makespan for scheduling problems with general deterioration effects
• Single-machine scheduling with aging effects and optional maintenance activity considerations
• Two-agent single-machine scheduling with resource-dependent starting times
• Inverse scheduling: Two-machine flow-shop problem
• Bicriterion scheduling with equal processing times on a batch processing machine
• Cutting plane algorithms for the inverse mixed integer linear programming problem
• Inverse scheduling with maximum lateness objective
• A genetic algorithm-based approach for single-machine scheduling with learning effect and release time
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Hybrid LS-SA-PS methods for solving fuzzy non-linear programming problems
• Inverse maximum flow problems under the weighted Hamming distance
• Single machine scheduling with preventive maintenances
• Inverse Optimization
• Feature Article—Genetic Algorithms for the Operations Researcher
• Genetic Algorithms
• Inverse Problem Theory and Methods for Model Parameter Estimation

This page was built for publication: An improved genetic algorithm for single-machine inverse scheduling problem