A new approach for bicriteria partitioning problem

DOI10.1007/S11590-014-0796-9MaRDI QIDQ2355323zbMATH OpenOpenAlexFDO

Authors Mengyang Gu, Zhiyi Tan, Binzhou Xia, Yujie Yan

Publication date 22 July 2015

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-014-0796-9

zbMATH Keywords

multiple criteria analysispartitioningschedulingworst-case analysis

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Multi-objective and goal programming (90C29)

Recommendations

• scientific article; zbMATH DE number 1784650
• scientific article; zbMATH DE number 4023039
• scientific article; zbMATH DE number 4049388
• scientific article; zbMATH DE number 1046599
• Norm-based approximation in bicriteria programming

Cites work

• A 3/2-approximation algorithm for k_i-partitioning
• A note on scheduling to meet two min-sum objectives
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• Algorithms for Scheduling Independent Tasks
• Approximation schemes for scheduling and covering on unrelated machines
• Approximation schemes for scheduling on parallel machines
• Bicriteria approximation algorithms for scheduling problems with communications delays
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1305482 (Why is no real title available?)
• scientific article; zbMATH DE number 1305545 (Why is no real title available?)
• scientific article; zbMATH DE number 2119733 (Why is no real title available?)
• Maximizing the minimum completion time on parallel machines
• Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
• On the existence of schedules that are near-optimal for both makespan and total weighted completion time
• Optimal Scheduling of Tasks on Identical Parallel Processors
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The \(k\)-partitioning problem
• The exact LPT-bound for maximizing the minimum completion time
• The Santa Claus problem

Cited in

(1)

• Parallel partitioning method (PPM): A new exact method to solve bi-objective problems

This page was built for publication: A new approach for bicriteria partitioning problem

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