• Home
  • Search
  • On-line scheduling of robotic cells with post-processing residency constraints
  • Cite Icon3
  • https://doi.org/10.1109/icsmc.2003.1244307Copy DOI Icon

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

  • Nov 10, 2003
  • Hyun Joong Yoon +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

This paper considers the problem of on-line scheduling of robotic cells with post-processing residency constraints. We model this scheduling problem with temporal constraints using Dechter, Meiri, and Pearl's formalism. Then, we present an on-line scheduling algorithm with polynomial computational complexity. The on-line scheduling algorithm consists of FEASIBLE/spl I.bar/SCHED/spl I.bar/SPACE and OPTIMAL/spl I.bar/SCHED. The former finds feasible solution space for a newly inserted part, which guarantees both logical and temporal correctness. The latter computes the optimal solution in the feasible solution space obtained previously. The objective of the scheduling is to minimize the completion time of the last operation of the part. We prove that each procedure has polynomial complexity.

Similar Papers
  • Conference Article

On-line scheduling of cluster tools based on hybrid quantum evolutionary algorithm

  • Aug 01, 2015
  • Linying Li +1
  • Conference Article
  • Citations147

On-line scheduling in the presence of overload

  • Sep 01, 1991
  • S Baruah +5
  • 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
  • Citations37

Online scheduling on two uniform machines to minimize the makespan

  • Jan 29, 2009
  • Theoretical Computer Science
  • Ming Liu +3
  • Conference Article
  • Citations19

Online Job Scheduling with Resource Packing on a Cluster of Heterogeneous Servers

  • Apr 01, 2019
  • Yang Liu +2
  • Research Article
  • Citations2

Solution Space Analysis and Feasible Genetic Algorithm for Assembly Job-Shop Scheduling Problems

  • Aug 01, 2009
  • Materials Science Forum
  • G.K Zhao +3
  • Conference Article
  • Citations12

MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling

  • Dec 01, 1993
  • G Koren +2
  • Research Article
  • Citations61

Optimal Online Scheduling With Arbitrary Hard Deadlines in Multihop Communication Networks

  • Feb 01, 2016
  • IEEE/ACM Transactions on Networking
  • Zhoujia Mao +2
  • Research Article

Online Scheduling on a Parallel‐Batch Machine With Pulse Interruptions

  • Mar 16, 2025
  • Naval Research Logistics (NRL)
  • Ran Lin +3
  • 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
  • Citations3

On-line preemptive machine scheduling with $$\ell _p$$ ℓ p norm on two uniform machines

  • Jul 05, 2014
  • Journal of Scheduling
  • Tianping Shuai +2
  • Conference Article
  • Citations5

On decentralized on-line scheduling of FMS

  • Jan 01, 1990
  • S Engell +2
  • Conference Article

Minimizing capacity requirements of cellular networks via delayed scheduling

  • Jun 01, 2013
  • Navid Hamed Azimi +4
  • 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
  • Book Chapter
  • Citations2

On the Robustness of Graham’s Algorithm for Online Scheduling

  • Aug 15, 2007
  • Michael Gatto +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.