Scheduling no-wait robotic cells with two and three machines

DOI10.1016/S0377-2217(99)00258-1MaRDI QIDQ1569933zbMATH OpenOpenAlexFDO

Authors Alessandro Agnetis

Publication date 4 September 2001

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0377-2217(99)00258-1

zbMATH Keywords

no-wait flow shoppolynomial algorithmsrobotic cells

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Part sequencing in three-machine no-wait robotic cells
• Scheduling in Robotic Cells: Classification, Two and Three Machine Cells
• Scheduling of parts and robot activities in a two machine robotic cell
• Scheduling in robotic cells: Complexity and steady state analysis
• Scheduling in Robotic Cells: Heuristics and Cell Design

Cites work

• A Linear Programming Approach to the Cutting-Stock Problem
• An improved algorithm for cyclic flowshop scheduling in a robotic cell
• Cyclic Scheduling of Identical Parts in a Robotic Cell
• On A Conjecture About Robotic Cells: New Simplified Proof For The Three-Machine Case
• Scheduling in Robotic Cells: Classification, Two and Three Machine Cells
• Scheduling of parts and robot activities in a two machine robotic cell
• Sequencing of robot activities and parts in two-machine robotic cells
• The Three-Machine No-Wait Flow Shop is NP-Complete

Cited in

(25)

• A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case
• An optimization-based heuristic for the robotic cell problem
• Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots
• On scheduling cycle shops: Classification, complexity and approximation
• A survey of scheduling problems with no-wait in process
• On the existence of dominating 6-cyclic schedules in four-machine robotic cells
• Robotic cell scheduling with operational flexibility
• Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times
• Cyclic flowshop scheduling with operators and robots: Vyacheslav Tanaev's vision and lasting contributions
• A review of TSP based approaches for flowshop scheduling
• A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots
• Multi-degree cyclic flow shop robotic cell scheduling problem: ant colony optimization
• An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem
• On A Conjecture About Robotic Cells: New Simplified Proof For The Three-Machine Case
• Part sequencing in three-machine no-wait robotic cells
• A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times
• A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell
• Scheduling robotic cells with fixed processing times or time windows: classification, solution approaches, polynomial algorithms and complexity
• Approximation algorithms for \(k\)-unit cyclic solutions in robotic cells
• Scheduling dual gripper robotic cell: one-unit cycles
• Sequencing and scheduling in robotic cells: recent developments
• Scheduling of coupled tasks and one-machine no-wait robotic cells
• Identical part production in cyclic robotic cells: Concepts, overview and open questions
• Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm
• Throughput optimization in robotic cells with input and output machine buffers: a comparative study of two key models

This page was built for publication: Scheduling no-wait robotic cells with two and three machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569933)