• Home
  • Search
  • An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times
  • Cite Icon14
  • https://doi.org/10.1016/j.ipl.2011.08.003Copy DOI Icon

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

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

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

Similar Papers
  • Conference Article

Online batching scheduling with delivery times related to processing times

  • Dec 01, 2010
  • Jueliang Hu +2
  • 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
  • Book Chapter
  • Citations2

On the Robustness of Graham’s Algorithm for Online Scheduling

  • Aug 15, 2007
  • Michael Gatto +1
  • Research Article

Improved Algorithms for Online Scheduling of Malleable Parallel Jobs on Two Identical Machines

  • Oct 01, 2015
  • Asia-Pacific Journal of Operational Research
  • Hao Zhou +2
  • Research Article
  • Citations14

Online batch scheduling on parallel machines with delivery times

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

Competitive analysis of on-line algorithms for on-demand data broadcast scheduling

  • Dec 07, 2000
  • Weizhen Mao
  • Book Chapter
  • Citations35

Online Computation with Advice

  • Jan 01, 2009
  • Yuval Emek +3
  • Conference Article
  • Citations1

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

  • Nov 01, 2018
  • Qianna Cui +1
  • Research Article

Online Euclidean Spanners

  • Nov 04, 2024
  • ACM Transactions on Algorithms
  • Sujoy Bhore +1
  • Supplementary Content

Competitive Prediction-Aware Online Algorithms for Energy Generation Scheduling in Microgrids

  • May 24, 2022
  • arXiv (Cornell University)
  • Ali Menati +2
  • 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
  • Research Article
  • Citations3

A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan

  • Jun 21, 2014
  • Computers & Operations Research
  • Peihai Liu +1
  • Research Article
  • Citations5

Online machine minimization with lookahead

  • Aug 09, 2020
  • Journal of Combinatorial Optimization
  • Cong Chen +2
  • Supplementary Content

Studies on optimization problems with dynamically arriving information

  • Jan 01, 2025
  • AMS Dottorato Institutional Doctoral Theses Repository (University of Bologna)
  • Lorenz, Catherine
  • 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
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.