An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time
DOI10.1016/J.IPL.2010.02.013zbMATH Open1209.68070OpenAlexW2043700761MaRDI QIDQ991796FDOQ991796
Authors: Jiping Tao, Zhijun Chao, Ye Tao, Yugeng Xi 
Publication date: 7 September 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.02.013
Recommendations
- A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times
- OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE
- A semi-online algorithm for solving the single machine scheduling problem to minimize total weighted completion time with discounted factor
- Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine
- A semi-online algorithm for single machine scheduling with rejection
analysis of algorithmssingle machine schedulingcompetitive ratiototal weighted completion timesemi-online algorithms
Analysis of algorithms (68W40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Online algorithms. The state of the art
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
- Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
- The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates
- Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
- Minimizing average completion time in the presence of release dates
- Title not available (Why is that?)
- Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates
- Asymptotic Performance Ratio of an Online Algorithm for the Single Machine Scheduling With Release Dates
Cited In (16)
- Single-machine online scheduling of jobs with non-delayed processing constraint
- Asymptotic Performance Ratio of an Online Algorithm for the Single Machine Scheduling With Release Dates
- Online scheduling to minimize the total weighted completion time plus the rejection cost
- A semi-online algorithm for solving the single machine scheduling problem to minimize total weighted completion time with discounted factor
- A semi-online algorithm for single machine scheduling with rejection
- OPTIMAL SEMI-ONLINE ALGORITHMS FOR m-BATCH-MACHINE FLOW SHOP SCHEDULING
- On competitive analysis for polling systems
- A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
- Online interval scheduling on a single machine with finite lookahead
- An optimal online algorithm for single machine scheduling with bounded delivery times
- A \(2.28\)-competitive algorithm for online scheduling on identical machines
- Title not available (Why is that?)
- A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times
- A competitive online algorithm for minimizing total weighted completion time on uniform machines
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
This page was built for publication: An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991796)
