메뉴 건너뛰기




Volumn 38, Issue 9, 2011, Pages 1275-1285

A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell

Author keywords

Multiple robots; No wait robotic cell; Polynomial algorithm; Scheduling

Indexed keywords

CYCLE TIME; CYCLIC SCHEDULING; CYCLIC SCHEDULING PROBLEMS; MULTIPLE ROBOT; MULTIROBOTS; NO-WAIT; OPTIMAL CYCLE TIME; POLYNOMIAL ALGORITHM; ROBOTIC CELL; SINGLE-TRACKS;

EID: 79251626563     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2010.11.008     Document Type: Article
Times cited : (32)

References (36)
  • 2
  • 3
    • 48849099813 scopus 로고    scopus 로고
    • Optimal scheduling of material handling devices in a PCB production line: Problem formulation and a polynomial algorithm
    • A. Che, and C. Chu Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm Mathematical Problems in Engineering 2008 2008 Article ID 364279, 21pp
    • (2008) Mathematical Problems in Engineering , vol.2008
    • Che, A.1    Chu, C.2
  • 5
    • 0027663342 scopus 로고
    • Minimizing the fleet size with dependent time window and single-track constraints
    • L. Lei, R. Armstrong, and S. Gu Minimizing the fleet size with dependent time window and single-track constraints Operations Research Letters 14 2 1993 91 98
    • (1993) Operations Research Letters , vol.14 , Issue.2 , pp. 91-98
    • Lei, L.1    Armstrong, R.2    Gu, S.3
  • 6
    • 0028396353 scopus 로고
    • Determining optimal cyclic hoist schedules in a single-hoist electroplating line
    • L. Lei, and T.J. Wang Determining optimal cyclic hoist schedules in a single-hoist electroplating line AIIE Transactions 26 2 1994 25 33
    • (1994) AIIE Transactions , vol.26 , Issue.2 , pp. 25-33
    • Lei, L.1    Wang, T.J.2
  • 7
    • 0037524472 scopus 로고    scopus 로고
    • Optimal cyclic scheduling for printed-circuit-board production lines with multiple hoists and general processing sequences
    • J. Leung, and G. Zhang Optimal cyclic scheduling for printed-circuit- board production lines with multiple hoists and general processing sequences IEEE Transactions on Robotics and Automation 19 3 2003 480 484
    • (2003) IEEE Transactions on Robotics and Automation , vol.19 , Issue.3 , pp. 480-484
    • Leung, J.1    Zhang, G.2
  • 8
    • 18744387412 scopus 로고    scopus 로고
    • An efficient optimal solution to the two-hoist no-wait cyclic scheduling problem
    • J. Liu, and Y. Jiang An efficient optimal solution to the two-hoist no-wait cyclic scheduling problem Operations Research 53 2 2005 313 327
    • (2005) Operations Research , vol.53 , Issue.2 , pp. 313-327
    • Liu, J.1    Jiang, Y.2
  • 9
    • 84877343203 scopus 로고
    • An algorithm for scheduling a chemical processing tank line
    • W. Song, Z.B. Zabinsky, and R.L. Storch An algorithm for scheduling a chemical processing tank line Production Planning & Control 4 4 1993 323 332
    • (1993) Production Planning & Control , vol.4 , Issue.4 , pp. 323-332
    • Song, W.1    Zabinsky, Z.B.2    Storch, R.L.3
  • 10
    • 0033871635 scopus 로고    scopus 로고
    • Scheduling no-wait robotic cells with two and three machines
    • A. Agnetis Scheduling no-wait robotic cells with two and three machines European Journal of Operational Research 123 2 2000 303 314
    • (2000) European Journal of Operational Research , vol.123 , Issue.2 , pp. 303-314
    • Agnetis, A.1
  • 11
    • 0034315580 scopus 로고    scopus 로고
    • Part sequencing in three-machine no-wait robotic cells
    • A. Agnetis, and D. Pacciarelli Part sequencing in three-machine no-wait robotic cells Operations Research Letters 27 4 2000 185 192
    • (2000) Operations Research Letters , vol.27 , Issue.4 , pp. 185-192
    • Agnetis, A.1    Pacciarelli, D.2
  • 12
    • 0031269154 scopus 로고    scopus 로고
    • A strongly polynomial algorithm for no-wait cyclic robotic flow shop scheduling
    • V. Kats, and E. Levner A strongly polynomial algorithm for no-wait cyclic robotic flow shop scheduling Operations Research Letters 21 4 1997 171 179
    • (1997) Operations Research Letters , vol.21 , Issue.4 , pp. 171-179
    • Kats, V.1    Levner, E.2
  • 13
    • 0037448766 scopus 로고    scopus 로고
    • A polynomial algorithm for 2-degree cyclic robot scheduling
    • A. Che, C. Chu, and E. Levner A polynomial algorithm for 2-degree cyclic robot scheduling European Journal of Operational Research 145 1 2003 31 44
    • (2003) European Journal of Operational Research , vol.145 , Issue.1 , pp. 31-44
    • Che, A.1    Chu, C.2    Levner, E.3
  • 14
    • 67349222218 scopus 로고    scopus 로고
    • Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots
    • A. Che, and C. Chu Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots European Journal of Operational Research 199 2009 77 88
    • (2009) European Journal of Operational Research , vol.199 , pp. 77-88
    • Che, A.1    Chu, C.2
  • 16
    • 56349083345 scopus 로고    scopus 로고
    • A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case
    • V. Kats, and E. Levner A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case Discrete Applied Mathematics 157 2 2009 339 355
    • (2009) Discrete Applied Mathematics , vol.157 , Issue.2 , pp. 339-355
    • Kats, V.1    Levner, E.2
  • 18
    • 59349109188 scopus 로고    scopus 로고
    • A quadratic algorithm for the 2-cyclic robotic scheduling problem
    • P. Saez A quadratic algorithm for the 2-cyclic robotic scheduling problem Theoretical Computer Science 410 2009 973 976
    • (2009) Theoretical Computer Science , vol.410 , pp. 973-976
    • Saez, P.1
  • 19
    • 0031635632 scopus 로고    scopus 로고
    • A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots
    • K. Kogan, and E. Levner A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots Computers & Operations Research 25 1 1998 53 62
    • (1998) Computers & Operations Research , vol.25 , Issue.1 , pp. 53-62
    • Kogan, K.1    Levner, E.2
  • 22
    • 33846053575 scopus 로고    scopus 로고
    • Scheduling in a three-machine robotic flexible manufacturing cell
    • H. Gultekin, M.S. Akturk, and O.E. Karasan Scheduling in a three-machine robotic flexible manufacturing cell Computers & Operations Research 34 8 2007 2463 2477
    • (2007) Computers & Operations Research , vol.34 , Issue.8 , pp. 2463-2477
    • Gultekin, H.1    Akturk, M.S.2    Karasan, O.E.3
  • 27
    • 49749086485 scopus 로고    scopus 로고
    • Identical part production in cyclic robotic cells: Concepts, overview and open questions
    • N. Brauner Identical part production in cyclic robotic cells: concepts, overview and open questions Discrete Applied Mathematics 156 13 2008 2480 2492
    • (2008) Discrete Applied Mathematics , vol.156 , Issue.13 , pp. 2480-2492
    • Brauner, N.1
  • 29
    • 33745207776 scopus 로고    scopus 로고
    • A faster polynomial algorithm for 2-cyclic robotic scheduling
    • C. Chu A faster polynomial algorithm for 2-cyclic robotic scheduling Journal of Scheduling 9 5 2006 453 468
    • (2006) Journal of Scheduling , vol.9 , Issue.5 , pp. 453-468
    • Chu, C.1
  • 30
  • 31
    • 33646102212 scopus 로고    scopus 로고
    • An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times
    • J. Leung, and E. Levner An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times Operation Research Letters 34 4 2006 465 572
    • (2006) Operation Research Letters , vol.34 , Issue.4 , pp. 465-572
    • Leung, J.1    Levner, E.2
  • 32
    • 0041682131 scopus 로고
    • Minimal quantity of operators for serving a homogeneous linear technological process
    • A.V. Karzanov, and E.M. Livshits Minimal quantity of operators for serving a homogeneous linear technological process Automation and Remote Control 3 1978 445 450
    • (1978) Automation and Remote Control , vol.3 , pp. 445-450
    • Karzanov, A.V.1    Livshits, E.M.2
  • 33
    • 0031540827 scopus 로고    scopus 로고
    • Minimizing the number of robots to meet a given cyclic schedule
    • V. Kats, and E. Levner Minimizing the number of robots to meet a given cyclic schedule Annals of Operations Research 69 1997 209 226
    • (1997) Annals of Operations Research , vol.69 , pp. 209-226
    • Kats, V.1    Levner, E.2
  • 34
    • 0345757595 scopus 로고    scopus 로고
    • Cyclic scheduling in a robotic production line
    • V. Kats, and E. Levner Cyclic scheduling in a robotic production line Journal of Scheduling 5 1 2002 23 41
    • (2002) Journal of Scheduling , vol.5 , Issue.1 , pp. 23-41
    • Kats, V.1    Levner, E.2
  • 36
    • 0007144602 scopus 로고
    • A dual of Dilworth's decomposition theorem
    • L. Mirsky A dual of Dilworth's decomposition theorem The American Mathematical Monthly 78 1971 876 877
    • (1971) The American Mathematical Monthly , vol.78 , pp. 876-877
    • Mirsky, L.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.