On the public citation graph

A (10/7)-Approximation Algorithm for an Optimum Cyclic Solution in Additive Travel-Time Robotic Cells

https://doi.org/10.2139/ssrn.2559376
0 signed · 19 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/(sici)1099-1425(199901/02)2:1<35::aid-jos15>3.0.co;2-jopenalex-extracted
Cyclic scheduling in 3-machine robotic flow shops
inferredcites →https://doi.org/10.1007/bf01324886openalex-extracted
Sequencing of parts and robot moves in a robotic cell
inferredcites →https://doi.org/10.1016/j.ejor.2003.09.013openalex-extracted
Approximation algorithms for k-unit cyclic solutions in robotic cells
inferredcites →https://doi.org/10.1016/s0377-2217(96)00272-xopenalex-extracted
An improved algorithm for cyclic flowshop scheduling in a robotic cell
inferredcites →https://doi.org/10.1016/s0377-2217(99)00258-1openalex-extracted
Scheduling no-wait robotic cells with two and three machines
inferredcites →https://doi.org/10.1016/s0895-7177(01)00084-xopenalex-extracted
Cycles and permutations in robotic cells
inferredcites →https://doi.org/10.1023/a:1018995317468openalex-extracted
Cyclic scheduling in robotic flowshops
inferredcites →https://doi.org/10.1023/b:josh.0000036861.28456.5dopenalex-extracted
Robotic Cells with Parallel Machines: Throughput Maximization in Constant Travel-Time Cells
inferredcites →https://doi.org/10.1080/03155986.1999.11732366openalex-extracted
On A Conjecture About Robotic Cells: New Simplified Proof For The Three-Machine Case
inferredcites →https://doi.org/10.1080/07408179408966593openalex-extracted
DETERMINING OPTIMAL CYCLIC HOIST SCHEDULES IN A SINGLE-HOIST ELECTROPLATING LINE
inferredcites →https://doi.org/10.1080/15458830.1996.11770714openalex-extracted
Scheduling: Theory, Algorithms, and Systems
inferredcites →https://doi.org/10.1109/66.843634openalex-extracted
Evaluating the impact of process changes on cluster tool performance
inferredcites →https://doi.org/10.1109/70.660860openalex-extracted
Cyclic scheduling of a hoist with time window constraints
inferredcites →https://doi.org/10.1109/70.988976openalex-extracted
Multicyclic hoist scheduling with constant processing times
inferredcites →https://doi.org/10.1137/s003614450444138xopenalex-extracted
Dominance of Cyclic Solutions and Challenges in the Scheduling of Robotic Cells
inferredcites →https://doi.org/10.1287/msom.4.4.296.5731openalex-extracted
On Throughput Maximization in Constant Travel-Time Robotic Cells
inferredcites →https://doi.org/10.1287/opre.44.3.510openalex-extracted
A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
inferredcites →https://doi.org/10.1287/opre.45.6.952openalex-extracted
Cyclic Scheduling of Identical Parts in a Robotic Cell
inferredcites →https://doi.org/10.1007/s10951-005-2861-9openalex-snapshot
Sequencing and Scheduling in Robotic Cells: Recent Developments
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.