Scheduling to minimize the maximum total completion time per machine

DOI10.1016/J.EJOR.2014.09.063MaRDI QIDQ726222zbMATH OpenOpenAlexFDO

Authors Long Wan, Zhihao Ding, Yunpeng Li, Zhiyi Tan, 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

schedulingworst-case ratioparallel machine

Mathematics Subject Classification ID

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

Recommendations

• On-line scheduling of parallel machines to minimize total completion times
• Notes on a hierarchical scheduling problem on identical machines
• Algorithms and Computation
• Parallel machine scheduling with time dependent processing times
• Scheduling jobs with equal processing times and a single server on parallel identical machines

Cites work

• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• 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
• Algorithms for Scheduling Independent Tasks
• Competitive two-agent scheduling and its applications
• Coordination mechanisms for selfish scheduling
• Fast approximation algorithms for bi-criteria scheduling with machine assignment costs
• How good are SPT schedules for fair optimality criteria
• Minimizing Schedule Length Subject to Minimum Flow Time
• Multicriteria scheduling
• Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
• Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines
• Scheduling Problems with Two Competing Agents
• Single machine batch scheduling with two competing agents to minimize total flowtime
• Two-agent scheduling to minimize the total cost
• Utilitarianism, Egalitarianism, and the Timing Effect in Social Choice Problems
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem

Cited in

(13)

• Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines
• Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed
• Two parallel-machine scheduling problems with function constraint
• Revisit of the scheduling problems with integrated production and delivery on parallel batching machines
• Scheduling with a minimum number of machines
• A note on minimizing the sum of quadratic completion times on two identical parallel machines
• Scheduling to minimize makespan about increase of processing times
• A lower bound for minimizing the total completion time of a three-agent scheduling problem
• Minimizing the number of machines for minimum length schedules
• The minimization scheduling problem of sum of squares of the machine completion times on two identical parallel machines
• Notes on a hierarchical scheduling problem on identical machines
• The inverse parallel machine scheduling problem with minimum total completion time
• Scheduling to minimize the total compression and late costs

This page was built for publication: Scheduling to minimize the maximum total completion time per machine

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