• Home
  • Search
  • Online Scheduling on a Parallel‐Batch Machine With Pulse Interruptions
  • https://doi.org/10.1002/nav.22263Copy DOI Icon

Online Scheduling on a Parallel‐Batch Machine With Pulse Interruptions

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

ABSTRACTWe consider an online scheduling problem on a parallel‐batch machine with pulse interruptions, which have negligible time lengths, to minimize the makespan. Jobs arrive over time, and the related information of a job becomes known at its arrival time. A parallel‐batch machine can process at most a given number of jobs simultaneously, with the processing time of a batch being equal to the longest processing time of the jobs in the batch. No batch can be processed during a pulse interruption, and preemption is not allowed. For the problem with periodic pulse interruptions, we show that there is no online algorithm with a competitive ratio of less than 2 and develop an online algorithm with a competitive ratio of at most 3. For the special case with a known pulse interruption, we demonstrate that the competitive ratio of the online algorithm is 2.5 and further prove that the online algorithm is the best possible when the batch capacity is 2 or unbounded. Finally, we perform numerical experiments to illustrate the performance of the online algorithm in practice.

Similar Papers
  • Research Article
  • Citations8

Heuristics for Online Scheduling on Identical Parallel Machines with Two GoS Levels

  • Aug 01, 2019
  • Journal of Systems Science and Complexity
  • Shuang Cai +1
  • 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
  • Citations25

Markov Decision Process Based Energy-Efficient On-Line Scheduling for Slice-Parallel Video Decoders on Multicore Systems

  • May 25, 2012
  • IEEE Transactions on Multimedia
  • Nicholas Mastronarde +4
  • Research Article
  • Citations7

The medical laboratory scheduling for weighted flow-time

  • Nov 20, 2017
  • Journal of Combinatorial Optimization
  • Wenhua Li +1
  • Book Chapter
  • Citations100

Online Scheduling via Learned Weights

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

Online scheduling with multi‐state machines

  • Dec 20, 2017
  • Networks
  • Dawsen Hwang +1
  • Book Chapter
  • Citations8

Online Scheduling of Bounded Length Jobs to Maximize Throughput

  • Jan 01, 2010
  • Christoph Dürr +2
  • Research Article
  • Citations4

On robust online scheduling algorithms

  • Jul 21, 2009
  • Journal of Scheduling
  • Michael Gatto +1
  • Conference Article

Online batching scheduling with delivery times related to processing times

  • Dec 01, 2010
  • Jueliang Hu +2
  • Conference Article
  • Citations3

On-line scheduling of robotic cells with post-processing residency constraints

  • Nov 10, 2003
  • Hyun Joong Yoon +1
  • Research Article
  • Citations37

Online scheduling on two uniform machines to minimize the makespan

  • Jan 29, 2009
  • Theoretical Computer Science
  • Ming Liu +3
  • Research Article
  • Citations15

A best online algorithm for scheduling on two parallel batch machines

  • Feb 24, 2009
  • Theoretical Computer Science
  • Ji Tian +2
  • Conference Article

Minimizing capacity requirements of cellular networks via delayed scheduling

  • Jun 01, 2013
  • Navid Hamed Azimi +4
  • Conference Article
  • Citations4

Car-sharing on a star network: on-line scheduling with k servers

  • Jan 06, 2020
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Kelin Luo +2
  • Research Article
  • Citations1

Online Scheduling on Two Parallel Identical Machines Under a Grade of Service Provision

  • Oct 29, 2020
  • Journal of the Operations Research Society of China
  • Shuang Cai +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.