Cyclic robot scheduling for 3D printer-based flexible assembly systems

DOI10.1007/S10479-018-3098-2zbMath1467.90009OpenAlexW2901032529WikidataQ128919348 ScholiaQ128919348MaRDI QIDQ829186

N. E. Zubov

Publication date: 5 May 2021

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-018-3098-2

zbMATH Keywords

flexible flow shoprobot scheduling3D printerassembly operation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

An overview on the use of operations research in additive manufacturing

Cites Work

• Unnamed Item
• A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots
• An efficient new heuristic for the hoist scheduling problem
• A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times
• Approximation algorithms for \(k\)-unit cyclic solutions in robotic cells
• A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times
• A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
• Identical part production in cyclic robotic cells: Concepts, overview and open questions
• A branch and bound algorithm for the two-stage assembly scheduling problem
• One-machine generalized precedence constrained scheduling problems
• A study of the cyclic scheduling problem on parallel processors
• Cyclic scheduling in robotic flowshops
• A polynomial algorithm for 2-degree cyclic robot scheduling
• The hybrid flow shop scheduling problem
• Flexible flow shop scheduling with uniform parallel machines
• Cyclic hoist scheduling in large real-life electroplating lines
• Real-time deadlock-free scheduling for semiconductor track systems based on colored timed Petri nets
• On Algorithms for Enumerating All Circuits of a Graph
• Performance Measures and Schedules in Periodic Job Shops
• The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
• Finding All the Elementary Circuits of a Directed Graph

This page was built for publication: Cyclic robot scheduling for 3D printer-based flexible assembly systems