Heuristic algorithms to maximize revenue and the number of jobs processed on parallel machines

DOI10.1134/S0005117919020085MaRDI QIDQ2290308zbMATH OpenOpenAlexFDO

Authors O. Gholami, Frank Werner, A. S. Zatsiupo, 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

zbMATH Keywords

genetic algorithmrevenue maximizationschedulingsimulated annealingtabu searchuniform machines

Mathematics Subject Classification ID

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

Recommendations

• Revenue maximization on parallel machines
• Heuristic algorithms for a complex parallel machine scheduling problem
• Some Heuristics for Scheduling Jobs on Parallel Machines with Setups
• A heuristic for maximizing the number of on-time jobs on two uniform parallel machines
• Heuristic algorithms for scheduling jobs on identical parallel machines via measures of spread
• An algorithm for the maximum revenue jobshop problem
• Heuristic and exact algorithms for the identical parallel machine scheduling problem
• Scheduling jobs on a single machine to maximize the total revenue of jobs
• Optimal and heuristic solution methods for a multiprocessor machine scheduling problem
• Heuristics for scheduling unrelated parallel machines

Cites work

• A tabu search algorithm for parallel machine total tardiness problem
• Complexity of shop-scheduling problems with fixed number of jobs: a survey
• Efficient algorithms for machine scheduling problems with earliness and tardiness penalties
• 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
• Heuristic methods for the identical parallel machine flowtime problem with set-up times
• Minimizing total weighted flow time under uncertainty using dominance and a stability box
• Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
• Operations research. A practical introduction
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel machine scheduling with earliness and tardiness penalties
• Revenue maximization on parallel machines
• Robust scheduling of parallel machines with sequence-dependent set-up costs
• Scheduling unrelated parallel machines with sequence-dependent setups

Cited in

(2)

• Revenue maximization on parallel machines
• Maximization of unit present profit in inventory management systems

This page was built for publication: Heuristic algorithms to maximize revenue and the number of jobs processed on parallel machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2290308)