N. G. Hall, H. Kamoun and C. Sriskandarajah, Scheduling in robotic cells: classication, two and three machine cells, Oper. Res. 45 (1997), 421-439. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On Scheduling Cycle Shops: Classification, Complexity And.. - Middendorf, Timkovsky (Correct)
....parallel machines [HM95, M96] and in recurrent job shops [H94] with potential or conjunctive constraints [CC90, H94] originated from pipeline computing [K81] ON SCHEDULING CYCLE SHOPS 9 2.4. Job characteristics and minimization criteria. In comparision with the classi cation of Hall et al. [HKS97] for periodic robotic ow shop problems, our classi cation includes them as well but remains the job characteristics eld the same as in the well known classi cation of classic nonperiodic problems, cf. LLRKS93, B95] f 1 ; 8g introduces preemption, no wait, precedence relation, ....
.... = q e 1 jLmax O(n 2 ) K99] RF3jr j ; p oj = 1; p ej = q e 1 jCmax O(n 2 ) K99] RF jn m 2; p oj = p; p ej = q e 1 jCmax O(1) HK98] RF2jno waitjBmax O(h log h) A00] RF2kBmax O(n log n) AK99] R1 2F2kCmax O(n log n) KSI91] R1 F2kBmax O(n log n) SSSBK92] R1 1;3;4;5 F3kBmax O(n log n) [HKS97] R1 1;4F3jno waitjBmax O(n log n) AP98] R1F jno wait; n = 1jP O(m 3 log m) KL98] R1Cjno wait; n = 1jP O( 5 ) KL97] R1F jn = 1jP O(m 3 ) CK97] C2jp ij = q i jCmax O(1) T85] C2jp ij = 1j P C j O(1) Section 3.3] C2jp ij = 1j P U j O(n 7 ) K99A] C2jno wait; p ij = 1j P f j O(n ....
[Article contains additional citation context not shown here]
N. G. Hall, H. Kamoun and C. Sriskandarajah, Scheduling in robotic cells: classication, two and three machine cells, Oper. Res. 45 (1997), 421-439.
Flow-Shop Problems with Transportation Times and a Single Robot - Hurink, Knust (1999) (4 citations) (Correct)
....without any bu ers (for an overview see Crama et al. 2] In most cases repetitive manufacturing is studied where the long run average cycle time has to be minimized. For special situations polynomial algorithms have been obtained by Sethi et al. 14] Crama van de Klundert [1] and Hall et al. [6]. Robotic cells with a single unit of bu er behind each machine have been studied by Finke et al. 3] Considering the case in which su cient robots are available for transportation leads to problems where the transportation times only correspond to minimal time lags (delays) between operations ....
N. Hall, H. Kamoun and C. Sriskandarajah, Scheduling in robotic cells: Classi- cation, two and three machine cells, Oper. Res. 45 (1997) 421-439.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC