Faster algorithms for bicriteria scheduling of identical jobs on uniform machines

DOI10.3934/jimo.2022178OpenAlexW4295918204MaRDI QIDQ2691455

Yanyan Li

Publication date: 29 March 2023

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2022178

zbMATH Keywords

schedulinguniform machinesPareto optimizationmin-maxmin-sum

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Bicriterion scheduling of identical processing time jobs by uniform processors
• Pareto-scheduling of two competing agents with their own equal processing times
• Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan
• Multiple criteria model for allocating new medical robotic devices to treatment centres
• Bicriteria scheduling of equal length jobs on uniform parallel machines
• Parallel machine problems with equal processing times: a survey
• Scheduling two agents on uniform parallel machines with~makespan and cost functions
• Multicriteria scheduling
• Scheduling identical jobs on uniform parallel machines
• Approximation Methods for Multiobjective Optimization Problems: A Survey
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints

This page was built for publication: Faster algorithms for bicriteria scheduling of identical jobs on uniform machines