Scheduling to minimize the maximum total completion time per machine

DOI10.1016/j.ejor.2014.09.063zbMath1341.90056OpenAlexW1976751535MaRDI QIDQ726222

Zhihao Ding, Yunpeng Li, Zhiyi Tan, Long Wan, Qian-Qian Chen

Publication date: 8 July 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.09.063

zbMATH Keywords

schedulingparallel machineworst-case ratio

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

A lower bound for minimizing the total completion time of a three-agent scheduling problem, Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines, Notes on a hierarchical scheduling problem on identical machines, Revisit of the scheduling problems with integrated production and delivery on parallel batching machines

Cites Work

• Unnamed Item
• Unnamed Item
• Fast approximation algorithms for bi-criteria scheduling with machine assignment costs
• Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines
• Single machine batch scheduling with two competing agents to minimize total flowtime
• Two-agent scheduling to minimize the total cost
• How good are SPT schedules for fair optimality criteria
• Coordination mechanisms for selfish scheduling
• A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
• A multiple-criterion model for machine scheduling
• Multicriteria scheduling
• Competitive Two-Agent Scheduling and Its Applications
• Scheduling Problems with Two Competing Agents
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
• Minimizing Schedule Length Subject to Minimum Flow Time
• Utilitarianism, Egalitarianism, and the Timing Effect in Social Choice Problems
• Algorithms for Scheduling Independent Tasks