✦ LIBER ✦

Scheduling in Reentrant Robotic Cells: Algorithms and Complexity

✍ Scribed by George Steiner; Zhihui Xue

Publisher: Springer US
Year: 2005
Tongue: English
Weight: 231 KB
Volume: 8
Category: Article
ISSN: 1094-6136
DOI: 10.1007/s10951-005-5314-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sequencing and Scheduling in Robotic Cel

Sequencing and Scheduling in Robotic Cells: Recent Developments

✍ Milind Dawande; H. Neil Geismar; Suresh P. Sethi; Chelliah Sriskandarajah 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 974 KB

Project scheduling with irregular costs:

Project scheduling with irregular costs: complexity, approximability, and algorithms

✍ Alexander Grigoriev; Gerhard J. Woeginger 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 166 KB

A scheduling algorithm for the reentrant

A scheduling algorithm for the reentrant shop: an application in semiconductor manufacture

✍ Yong-Ha Kang; Sung-Shick Kim; Hyun Joon Shin 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 196 KB

A simulated annealing algorithm for the

A simulated annealing algorithm for the job shop cell scheduling problem with intercellular moves and reentrant parts

✍ Atabak Elmi; Maghsud Solimanpur; Seyda Topaloglu; Afshin Elmi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 444 KB

This paper addresses the problem of scheduling parts in job shop cellular manufacturing systems by considering exceptional parts that need to visit machines in different cells and reentrant parts which need to visit some machines more than once in non-consecutive manner. Initially, an integer linear

Mutual exclusion scheduling with interva

Mutual exclusion scheduling with interval graphs or related classes: Complexity and algorithms

✍ Frédéric Gardi 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 55 KB

Complexity and algorithms for two-stage

Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints

✍ Jinxing Xie; Xijun Wang 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 519 KB

This paper considers the two-stage flexible flowshop scheduling problem with availability constraints. We discuss the complexity and the approximability of the problem, and provide some approximation algorithms with finite and tight worst case performance bounds for some special cases of the problem