Fast approximation algorithms for bi-criteria scheduling with machine assignment costs

DOI10.1016/j.ejor.2014.03.026zbMath1338.90170OpenAlexW1986636858MaRDI QIDQ296690

Zhao-hong Jia, Kangbok Lee, Joseph Y.-T. Leung, Bertrand M. T. Lin, Wenhua Li, Michael L. Pinedo

Publication date: 23 June 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.03.026

zbMATH Keywords

heuristicsmakespantotal completion timebi-criteria schedulingmaximum machine costtotal machine cost

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (5)

Acquisition planning and scheduling of computing resources ⋮ Scheduling to minimize the maximum total completion time per machine ⋮ Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs ⋮ Minimizing machine assignment costs over \(\Delta\)-approximate solutions of the scheduling problem \(P||C_{\max}\) ⋮ Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coordination mechanisms with hybrid local policies
• On the exact upper bound for the Multifit processor scheduling algorithm
• Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
• An approximation algorithm for the generalized assignment problem
• Coordination mechanisms for parallel machine scheduling
• Multicriteria scheduling
• Multicriteria scheduling problems: a survey
• Competitive Two-Agent Scheduling and Its Applications
• Scheduling Problems with Two Competing Agents
• Minimizing Schedule Length Subject to Minimum Flow Time
• Bounds for List Schedules on Uniform Processors
• Minimizing Total Completion Time on Parallel Machines with Deadline Constraints
• Better Online Algorithms for Scheduling with Machine Cost
• Bounds on Multiprocessing Timing Anomalies
• Scheduling
• Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry

This page was built for publication: Fast approximation algorithms for bi-criteria scheduling with machine assignment costs