Online scheduling of jobs with kind release times and deadlines on a single machine

DOI10.1007/S11766-019-3512-9MaRDI QIDQ2422652zbMATH OpenOpenAlexFDO

Authors Ran Ma, Qi Feng, Wenjie Li

Publication date 20 June 2019

Published in Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11766-019-3512-9

zbMATH Keywords

schedulingonline algorithmdeadlinekind release time

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Dynamic programming (90C39) Stochastic scheduling theory in operations research (90B36)

Recommendations

• On-line scheduling for jobs with arbitrary release times
• Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines
• Online scheduling of jobs with fixed start times on related machines
• Online scheduling of jobs with fixed start times on related machines
• A Note on Online Scheduling for Jobs with Arbitrary Release Times
• Online scheduling on a single machine with deteriorating jobs and job delivery
• Online real-time preemptive scheduling of jobs with deadlines on multiple machines
• Single-machine online scheduling of jobs with non-delayed processing constraint
• Online scheduling on a single machine with grouped processing times
• Online scheduling on two parallel machines with release dates and delivery times

Cites work

• scientific article; zbMATH DE number 2109192 (Why is no real title available?)
• A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
• LPT online strategy for parallel-machine scheduling with kind release times
• On-line scheduling on a single machine: Maximizing the number of early jobs
• On-line scheduling to maximize task completions.
• Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help
• Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
• Online Scheduling with Hard Deadlines
• Online over time scheduling on parallel-batch machines: a survey
• Online scheduling on unbounded parallel-batch machines to minimize the makespan

Cited in

(3)

• Online scheduling on a single machine with grouped processing times
• Online real-time preemptive scheduling of jobs with deadlines on multiple machines
• On-line scheduling of jobs with fixed start and end times

This page was built for publication: Online scheduling of jobs with kind release times and deadlines on a single machine

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