Heuristic algorithms to maximize revenue and the number of jobs processed on parallel machines
From MaRDI portal
Publication:2290308
DOI10.1134/S0005117919020085zbMath1477.90021OpenAlexW2941892718MaRDI QIDQ2290308
Frank Werner, A. S. Zatsiupo, O. Gholami, Yuri N. Sotskov
Publication date: 27 January 2020
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117919020085
Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Cites Work
- Robust scheduling of parallel machines with sequence-dependent set-up costs
- Scheduling unrelated parallel machines with sequence-dependent setups
- Efficient algorithms for machine scheduling problems with earliness and tardiness penalties
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- Parallel machine scheduling with earliness and tardiness penalties
- Minimizing total weighted flow time under uncertainty using dominance and a stability box
- A tabu search algorithm for parallel machine total tardiness problem
- Heuristic methods for the identical parallel machine flowtime problem with set-up times
- Future paths for integer programming and links to artificial intelligence
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
- Complexity of shop-scheduling problems with fixed number of jobs: a survey
- Operations Research
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Revenue Maximization on Parallel Machines
This page was built for publication: Heuristic algorithms to maximize revenue and the number of jobs processed on parallel machines
