Uniform machine scheduling with arrival time and rejection

DOI10.3785/J.ISSN.1008-9497.2016.05.009MaRDI QIDQ5282517zbMATH OpenFDO

Authors Jian Hua Rong, Li-Ying Hou

Publication date 14 July 2017

Full work available at URL https://doi.org/10.3785/J.ISSN.1008-9497.2016.05.009

zbMATH Keywords

competitive ratioon-line schedulingrejectionuniform machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A special case of on-line scheduling on two uniformly machines with rejection
• On-line uniform machine scheduling with rejection
• On-line scheduling of unit time jobs with rejection on uniform machines
• Semi on-line preemptive scheduling on two uniform machines with rejection
• Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines

Cited in

(4)

• On-line scheduling of unit time jobs with rejection on uniform machines
• On-line uniform machine scheduling with rejection
• scientific article; zbMATH DE number 7235219 (Why is no real title available?)
• A special case of on-line scheduling on two uniformly machines with rejection

This page was built for publication: Uniform machine scheduling with arrival time and rejection

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