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

DOI10.1016/J.EJOR.2014.03.026MaRDI QIDQ296690zbMATH OpenOpenAlexFDO

Authors Kangbok Lee, Joseph Y.-T. Leung, Zhao-hong Jia, Wenhua Li, B. M. T. Lin, 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

heuristicsmakespanbi-criteria schedulingmaximum machine costtotal completion timetotal machine cost

Mathematics Subject Classification ID

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

Recommendations

• Minimizing machine assignment costs over \(\Delta\)-approximate solutions of the scheduling problem \(P||C_{\max}\)
• An approximation algorithm for the generalized assignment problem
• Batching machine scheduling with bicriteria: maximum cost and makespan
• scientific article; zbMATH DE number 437570
• Two dimensional load balancing

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1418274 (Why is no real title available?)
• scientific article; zbMATH DE number 6297793 (Why is no real title available?)
• An approximation algorithm for the generalized assignment problem
• Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
• Better Online Algorithms for Scheduling with Machine Cost
• Bounds for List Schedules on Uniform Processors
• Bounds on Multiprocessing Timing Anomalies
• Competitive two-agent scheduling and its applications
• Coordination mechanisms for parallel machine scheduling
• Coordination mechanisms with hybrid local policies
• Minimizing Schedule Length Subject to Minimum Flow Time
• Minimizing Total Completion Time on Parallel Machines with Deadline Constraints
• Multicriteria scheduling
• Multicriteria scheduling problems: a survey
• Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
• On the exact upper bound for the Multifit processor scheduling algorithm
• Scheduling Problems with Two Competing Agents
• Scheduling. Theory, algorithms, and systems.
• Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry

Cited in

(8)

• Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time
• Approximation algorithms for scheduling parallel machines with an energy constraint in green manufacturing
• Scheduling to minimize the maximum total completion time per machine
• Minimizing machine assignment costs over \(\Delta\)-approximate solutions of the scheduling problem \(P||C_{\max}\)
• Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs
• Acquisition planning and scheduling of computing resources
• Faster algorithms for bicriteria scheduling of identical jobs on uniform machines
• A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing

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

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