Semi on-line scheduling on three processors with known sum of the tasks

DOI10.1007/S10951-007-0023-YMaRDI QIDQ835557zbMATH OpenOpenAlexFDO

Authors Enrico Angelelli, Maria Grazia Speranza, Zsolt Tuza

Publication date 28 August 2009

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10951-007-0023-y

zbMATH Keywords

competitive analysisparallel processorssemi on-line scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks
• The on-line multiprocessor scheduling problem with known sum of the tasks
• Semi-online scheduling on two uniform processors
• New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks
• An efficient algorithm for semi-online multiprocessor scheduling with given total processing time

Cites work

• scientific article; zbMATH DE number 4130003 (Why is no real title available?)
• scientific article; zbMATH DE number 1175952 (Why is no real title available?)
• Better Bounds for Online Scheduling
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• On-line scheduling revisited
• Semi on-line algorithms for the partition problem
• Semi on-line scheduling on two identical machines
• Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks
• Semi-on-line scheduling on two parallel processors with an upper bound on the items
• The on-line multiprocessor scheduling problem with known sum of the tasks

Cited in

(13)

• Semi-online scheduling problems on a small number of machines
• Semi-online scheduling on two identical parallel machines with initial-lookahead information
• Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
• A survey on makespan minimization in semi-online environments
• Lower bounds and semi on-line multiprocessor scheduling
• Online early work maximization on three hierarchical machines with a common due date
• The on-line multiprocessor scheduling problem with known sum of the tasks
• Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence
• Semi-on-line scheduling on two parallel processors with an upper bound on the items
• New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks
• Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
• Semi-online scheduling: a survey
• Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks

This page was built for publication: Semi on-line scheduling on three processors with known sum of the tasks

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