Cyclic scheduling in robotic flowshops with bounded work-in-process levels

DOI10.1002/NAV.20435MaRDI QIDQ2994797zbMATH OpenOpenAlexFDO

Authors Ada Che, Vladimir Kats, Eugene Levner

Publication date 29 April 2011

Published in Naval Research Logistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.20435

zbMATH Keywords

complexitymulti-cyclic schedulingno-waitpolynomial algorithmsrobotic schedulingwork-in-process

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling
• An improved algorithm for cyclic flowshop scheduling in a robotic cell
• Cyclic scheduling in robotic flowshops
• Cyclic scheduling in 3-machine robotic flow shops
• A mixed integer programming approach for multi-cyclic robotic flowshop scheduling with time window constraints

Cites work

• A faster polynomial algorithm for 2-cyclic robotic scheduling
• A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case
• A polynomial algorithm for 2-degree cyclic robot scheduling
• A quadratic algorithm for the 2-cyclic robotic scheduling problem
• An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times
• An improved algorithm for cyclic flowshop scheduling in a robotic cell
• Approximation algorithms for \(k\)-unit cyclic solutions in robotic cells
• Cyclic scheduling in a robotic production line
• Cyclic scheduling in flow lines: Modeling observations, effective heuristics and a cycle time minimization procedure
• Cyclic scheduling in robotic flowshops
• Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm
• Performance Measures and Schedules in Periodic Job Shops
• Scheduling analysis of FMS: an unfolding timed Petri nets approach
• Scheduling of flexible flow lines in an automobile assembly plant
• Sequencing and scheduling in robotic cells: recent developments

Cited in

(10)

• An improved algorithm for cyclic flowshop scheduling in a robotic cell
• Complexity of one-cycle robotic flow-shops
• An efficient bicriteria algorithm for stable robotic flow shop scheduling
• Cyclic flowshop scheduling with operators and robots: Vyacheslav Tanaev's vision and lasting contributions
• A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows
• Scheduling a wet station for wafer cleaning with multiple job flows and multiple wafer-handling robots
• Optimal Cyclic Scheduling Of A Robotic Processing Line With Two-Product And Time-Window Constraints
• A mixed integer programming approach for multi-cyclic robotic flowshop scheduling with time window constraints
• Scheduling robotic cells with fixed processing times or time windows: classification, solution approaches, polynomial algorithms and complexity
• Deciding the feasibility of a given throughput rate in 2-cyclic robotic scheduling

This page was built for publication: Cyclic scheduling in robotic flowshops with bounded work-in-process levels

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