• Home
  • Search
  • Online batching scheduling with delivery times related to processing times
  • https://doi.org/10.1109/icise.2010.5688741Copy DOI Icon

Online batching scheduling with delivery times related to processing times

  • Dec 1, 2010
  • Jueliang Hu +2 more
Show More
  • Abstract
  • Literature Map
  • References
  • Similar Papers
Abstract

We study a single batch machine on-line scheduling problem with delivery times, which is related to processing times. Once the processing of a job is completed it is delivered to the destination, the objective is to minimize the time by which all jobs have been delivered. For each job J <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">j</inf> , its arrival time, processing time and delivery time are denoted by r <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">j</inf> , p <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">j</inf> and q <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">j</inf> , respectively. Two variants are considered: 1) p <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">j</inf> ≥ βq <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">j</inf> , we provide an optimal on-line algorithm with competitive ratio (√5+1)/2; 2) q <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">j</inf> = βq <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">j</inf> , we provide an on-line algorithm with competitive ratio(√β <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> +2β+5−β+1)/2, and give a lower bound (√β+5)/(β+1)+1)/2.

Similar Papers
  • Research Article
  • Citations14

An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times

  • Aug 16, 2011
  • Information Processing Letters
  • Ji Tian +2
  • Research Article
  • Citations14

Online batch scheduling on parallel machines with delivery times

  • Jun 14, 2011
  • Theoretical Computer Science
  • Yang Fang +2
  • Conference Article
  • Citations13

The Power of Migration for Online Slack Scheduling.

  • Jan 01, 2016
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Chris Schwiegelshohn +1
  • Research Article
  • Citations19

An improved on-line algorithm for single parallel-batch machine scheduling with delivery times

  • Dec 29, 2011
  • Discrete Applied Mathematics
  • Ji Tian +3
  • Research Article
  • Citations1

An Optimal Online Algorithm for Scheduling with Learning Consideration

  • May 26, 2021
  • Asia-Pacific Journal of Operational Research
  • Ran Ma +3
  • Research Article
  • Citations32

Online real-time preemptive scheduling of jobs with deadlines on multiple machines

  • Jan 01, 2001
  • Journal of Scheduling
  • Bhaskar Das Gupta +1
  • Book Chapter
  • Citations35

Online Computation with Advice

  • Jan 01, 2009
  • Yuval Emek +3
  • Research Article

Online Euclidean Spanners

  • Nov 04, 2024
  • ACM Transactions on Algorithms
  • Sujoy Bhore +1
  • Research Article

Augmenting Online Algorithms for Knapsack Problem with Total Weight Information

  • Apr 11, 2025
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • Binghan Wu +2
  • Research Article
  • Citations14

A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times

  • Jan 01, 2010
  • Journal of Industrial &amp; Management Optimization
  • Jiping Tao +2
  • Research Article
  • Citations9

Semi-online scheduling with two GoS levels and unit processing time

  • Nov 22, 2013
  • Theoretical Computer Science
  • Taibo Luo +3
  • Research Article

An on-line scheduling problem of parallel machines with common maintenance time

  • Apr 01, 2013
  • Journal of Systems Science and Complexity
  • Qi Feng +3
  • Book Chapter
  • Citations100

Online Scheduling via Learned Weights

  • Jan 01, 2020
  • Silvio Lattanzi +3
  • Research Article
  • Citations15

Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time

  • Jun 21, 2011
  • Information Processing Letters
  • Wenhua Li +1
  • Conference Article
  • Citations1

Online and Semi-Online Vector Scheduling on A Single Machine with Rejection

  • Nov 01, 2018
  • Qianna Cui +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.