메뉴 건너뛰기




Volumn 59, Issue 2, 2010, Pages 352-361

Complexity of cyclic scheduling problems: A state-of-the-art survey

Author keywords

Complexity; Cyclic scheduling problems; Reducibility; Robotic scheduling

Indexed keywords

JOB SHOP SCHEDULING; ROBOTICS; SURVEYS;

EID: 77955700913     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2010.03.013     Document Type: Short Survey
Times cited : (159)

References (130)
  • 1
    • 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 2000 303 314
    • (2000) European Journal of Operational Research , vol.123 , pp. 303-314
    • Agnetis, A.1
  • 2
    • 0034315580 scopus 로고    scopus 로고
    • Part sequencing in three-machine no-wait robotic cells
    • DOI 10.1016/S0167-6377(00)00046-8
    • A. Agnetis, and D. Pacciarelli Part sequencing in three-machine no-wait robotic cells Operations Research Letters 27 4 2000 185 192 (Pubitemid 32035503)
    • (2000) Operations Research Letters , vol.27 , Issue.4 , pp. 185-192
    • Agnetis, A.1    Pacciarelli, D.2
  • 7
    • 33947623717 scopus 로고    scopus 로고
    • A critical review on the design and retrofit of batch plants
    • A.P.F.D. Barbosa-Póvoa A critical review on the design and retrofit of batch plants Computers and Chemical Engineering 31 2007 833 855
    • (2007) Computers and Chemical Engineering , vol.31 , pp. 833-855
    • Barbosa-Póvoa, A.P.F.D.1
  • 8
    • 0019562318 scopus 로고
    • A guaranteed-accuracy round-off algorithm for cyclic scheduling and set covering
    • J.J. Bartholdi A guaranteed-accuracy round-off algorithm for cyclic scheduling and set covering Operations Research 29 3 1982 501 510
    • (1982) Operations Research , vol.29 , Issue.3 , pp. 501-510
    • Bartholdi, J.J.1
  • 10
    • 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 2008 2480 2492
    • (2008) Discrete Applied Mathematics , vol.156 , pp. 2480-2492
    • Brauner, N.1
  • 11
    • 0346854660 scopus 로고    scopus 로고
    • A proof of the Lei and Wang claim
    • Laboratoire Leibnitz, Institute IMAG, Grenoble
    • Brauner, N., Finke, G., & Kubiak, W. (1997). A proof of the Lei and Wang claim. Technical note, Laboratoire Leibnitz, Institute IMAG, Grenoble.
    • (1997) Technical Note
    • Brauner, N.1    Finke, G.2    Kubiak, W.3
  • 14
    • 21144451714 scopus 로고    scopus 로고
    • Tabu search algorithms for cyclic machine scheduling problems
    • P. Brucker, and T. Kampmeyer Tabu search algorithms for cyclic machine scheduling problems Journal of Scheduling 8 4 2005 303 322
    • (2005) Journal of Scheduling , vol.8 , Issue.4 , pp. 303-322
    • Brucker, P.1    Kampmeyer, T.2
  • 17
    • 38149039321 scopus 로고    scopus 로고
    • Simultaneous batching and scheduling of single stage batch plants with parallel units
    • P.M. Castro, M. Erdirik-Dogan, and I.E. Grossmann Simultaneous batching and scheduling of single stage batch plants with parallel units AIChE Journal 54 1 2008 183 193
    • (2008) AIChE Journal , vol.54 , Issue.1 , pp. 183-193
    • Castro, P.M.1    Erdirik-Dogan, M.2    Grossmann, I.E.3
  • 18
    • 10044233768 scopus 로고    scopus 로고
    • A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line
    • A. Che, and C. Chu A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line Operations Research Letters 33 2005 274 284
    • (2005) Operations Research Letters , vol.33 , pp. 274-284
    • Che, A.1    Chu, C.2
  • 19
    • 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
  • 21
    • 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
  • 24
    • 0003925289 scopus 로고
    • The basic cyclic scheduling problem with deadline
    • P. Chrétienne The basic cyclic scheduling problem with deadline Discrete Applied Mathematics 30 1991 109 123
    • (1991) Discrete Applied Mathematics , vol.30 , pp. 109-123
    • Chrétienne, P.1
  • 25
    • 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 2006 453 468
    • (2006) Journal of Scheduling , vol.9 , pp. 453-468
    • Chu, C.1
  • 26
    • 0022026963 scopus 로고
    • A linear system theoretic view of discrete event processes and its use for performance evaluation in manufacturing
    • G. Cohen, D. Dubois, J.P. Quadrat, and M. Viot A linear system theoretic view of discrete event processes and its use for performance evaluation in manufacturing IEEE Transactions on Automatic Control 30 1 1985 210 220
    • (1985) IEEE Transactions on Automatic Control , vol.30 , Issue.1 , pp. 210-220
    • Cohen, G.1    Dubois, D.2    Quadrat, J.P.3    Viot, M.4
  • 27
    • 0009166239 scopus 로고    scopus 로고
    • Robotic flowshop scheduling is strongly NP-complete
    • Klein Haneveld, W. K. (Ed.) Amsterdam
    • Crama, Y., & van de Klundert, J. (1997). Robotic flowshop scheduling is strongly NP-complete. In Klein Haneveld, W. K. (Ed.), Ten years LNMB. CWI Tract, Amsterdam, pp. 277-286.
    • (1997) Ten Years LNMB. CWI Tract , pp. 277-286
    • Crama, Y.1    Van De Klundert, J.2
  • 29
    • 0002438198 scopus 로고
    • Describing industrial processes with interference and approximating their steady-state behaviour
    • R.A. Cuninghame-Green Describing industrial processes with interference and approximating their steady-state behaviour Operational Research Quarterly 13 1 1962 95 100
    • (1962) Operational Research Quarterly , vol.13 , Issue.1 , pp. 95-100
    • Cuninghame-Green, R.A.1
  • 36
    • 2442583184 scopus 로고    scopus 로고
    • Continuous-time versus discrete time approaches for scheduling of chemical processes: A review
    • C.A. Floudas, and X. Lin Continuous-time versus discrete time approaches for scheduling of chemical processes: A review Computers and Chemical Engineering 28 2004 2109 2129
    • (2004) Computers and Chemical Engineering , vol.28 , pp. 2109-2129
    • Floudas, C.A.1    Lin, X.2
  • 37
    • 0010777229 scopus 로고    scopus 로고
    • Optimal buffer allocation in asynchronous cyclic mixed-model assembly lines
    • L. Fuxman Optimal buffer allocation in asynchronous cyclic mixed-model assembly lines Production and Operations Management 7 3 1998 294 311
    • (1998) Production and Operations Management , vol.7 , Issue.3 , pp. 294-311
    • Fuxman, L.1
  • 42
    • 0141664156 scopus 로고    scopus 로고
    • Review of non-linear mixed-integer and disjunctive programming techniques for process systems engineering
    • I.E. Grossmann Review of non-linear mixed-integer and disjunctive programming techniques for process systems engineering Journal of Optimization and Engineering 3 2002 227 252
    • (2002) Journal of Optimization and Engineering , vol.3 , pp. 227-252
    • Grossmann, I.E.1
  • 43
    • 70350571109 scopus 로고    scopus 로고
    • Bicriteria robotic operation allocation in a flexible manufacturing cell
    • H. Gultekin, M.S. Akturk, and O.E. Karasan Bicriteria robotic operation allocation in a flexible manufacturing cell Computers and Operations Research 37 4 2010 779 789
    • (2010) Computers and Operations Research , vol.37 , Issue.4 , pp. 779-789
    • Gultekin, H.1    Akturk, M.S.2    Karasan, O.E.3
  • 44
    • 0012220631 scopus 로고    scopus 로고
    • Operations research techniques for robotic system planning, design, control and analysis
    • N.G. Hall Operations research techniques for robotic system planning, design, control and analysis S.Y. Nof, Handbook of industrial robotics vol. II 1999 John Wiley New York 543 577
    • (1999) Handbook of Industrial Robotics , vol.2 , pp. 543-577
    • Hall, N.G.1
  • 46
    • 0012220632 scopus 로고    scopus 로고
    • The complexity of cyclic shop scheduling problems
    • N.G. Hall, T.E. Lee, and M.E. Posner The complexity of cyclic shop scheduling problems Journal of Scheduling 5 2002 307 327
    • (2002) Journal of Scheduling , vol.5 , pp. 307-327
    • Hall, N.G.1    Lee, T.E.2    Posner, M.E.3
  • 48
    • 0028766191 scopus 로고
    • Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
    • C. Hanen Study of a NP-hard cyclic scheduling problem: The recurrent job-shop European Journal of Operational Research 72 1994 82 101
    • (1994) European Journal of Operational Research , vol.72 , pp. 82-101
    • Hanen, C.1
  • 49
    • 0002591492 scopus 로고
    • Cyclic scheduling on parallel processors: An overview
    • C. Hanen, and A. Munier Cyclic scheduling on parallel processors: An overview P. Chretienne, E.G. Coffman Jr. J.K. Lenstra, Z. Liu, Scheduling theory and its applications 1995 Wiley New York 194 226
    • (1995) Scheduling Theory and Its Applications , pp. 194-226
    • Hanen, C.1    Munier, A.2
  • 50
    • 0006673324 scopus 로고
    • A study of the cyclic scheduling problem on parallel processors
    • C. Hanen, and A. Munier A study of the cyclic scheduling problem on parallel processors Discrete Applied Mathematics 57 1995 167 192
    • (1995) Discrete Applied Mathematics , vol.57 , pp. 167-192
    • Hanen, C.1    Munier, A.2
  • 51
    • 56349104118 scopus 로고    scopus 로고
    • Periodic schedules for linear precedence constraints
    • C. Hanen, and A. Munier Kordon Periodic schedules for linear precedence constraints Discrete Applied Mathematics 157 2009 280 291
    • (2009) Discrete Applied Mathematics , vol.157 , pp. 280-291
    • Hanen, C.1    Munier Kordon, A.2
  • 52
    • 3242735620 scopus 로고    scopus 로고
    • A constraint propagation heuristic for the single-hoist, multiple-products scheduling problem
    • K. Hindi, and K. Fleszar A constraint propagation heuristic for the single-hoist, multiple-products scheduling problem Computers & Industrial Engineering 47 1 2004 91 101
    • (2004) Computers & Industrial Engineering , vol.47 , Issue.1 , pp. 91-101
    • Hindi, K.1    Fleszar, K.2
  • 54
    • 0020587837 scopus 로고
    • On the general feasibility test of scheduling lot sizes for several products on one machine
    • W.L. Hsu On the general feasibility test of scheduling lot sizes for several products on one machine Management Science 29 1983 93 103
    • (1983) Management Science , vol.29 , pp. 93-103
    • Hsu, W.L.1
  • 56
    • 84867375240 scopus 로고    scopus 로고
    • A tabu search algorithm for scheduling a single robot in a job-shop environment
    • J. Hurink, and S. Knust A tabu search algorithm for scheduling a single robot in a job-shop environment Discrete Applied Mathematics 119 2002 181 203
    • (2002) Discrete Applied Mathematics , vol.119 , pp. 181-203
    • Hurink, J.1    Knust, S.2
  • 58
    • 34548390510 scopus 로고    scopus 로고
    • Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
    • I. Kacem, C. Chu, and A. Souissi Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times Computers & Operations Research 35 2008 827 844
    • (2008) Computers & Operations Research , vol.35 , pp. 827-844
    • Kacem, I.1    Chu, C.2    Souissi, A.3
  • 60
    • 38749104007 scopus 로고    scopus 로고
    • PhD Thesis, University of Osnabrück, Germany
    • Kampmeyer, T. (2006). Cyclic scheduling problems. PhD Thesis, University of Osnabrück, Germany.
    • (2006) Cyclic Scheduling Problems
    • Kampmeyer, T.1
  • 61
    • 0000757511 scopus 로고    scopus 로고
    • Cyclic scheduling in flow lines: Modelling, observations, effective heuristics and a cycle time minimization procedure
    • S. Karabati, and P. Kouvelis Cyclic scheduling in flow lines: Modelling, observations, effective heuristics and a cycle time minimization procedure Naval Research Logistics 43 1996 211 231
    • (1996) Naval Research Logistics , vol.43 , pp. 211-231
    • Karabati, S.1    Kouvelis, P.2
  • 62
    • 0003037529 scopus 로고
    • Reducibility among combinatorial problems
    • R.M. Karp Reducibility among combinatorial problems R.E. Miller, J.W. Thatcher, Complexity of computer computations 1972 Plenum Press New York 85 100
    • (1972) Complexity of Computer Computations , pp. 85-100
    • Karp, R.M.1
  • 63
    • 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 39 3 1978 445 450
    • (1978) Automation and Remote Control , vol.39 , Issue.3 , pp. 445-450
    • Karzanov, A.V.1    Livshits, E.M.2
  • 64
    • 2442517409 scopus 로고
    • An exact optimal cyclic scheduling algorithm for multioperator service of a production line
    • V. Kats An exact optimal cyclic scheduling algorithm for multioperator service of a production line Automation and Remote Control 422 1982 538 543
    • (1982) Automation and Remote Control , vol.422 , pp. 538-543
    • Kats, V.1
  • 66
    • 37049026687 scopus 로고    scopus 로고
    • Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence and time-window constraints
    • V. Kats, L. Lei, and E. Levner Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence and time-window constraints European Journal of Operational Research 187 3 2008 1196 1211
    • (2008) European Journal of Operational Research , vol.187 , Issue.3 , pp. 1196-1211
    • Kats, V.1    Lei, L.2    Levner, E.3
  • 67
    • 0031269154 scopus 로고    scopus 로고
    • A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling
    • PII S0167637797000369
    • V. Kats, and E. Levner A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling Operations Research Letters 21 1997 171 179 (Pubitemid 127423523)
    • (1997) Operations Research Letters , vol.21 , Issue.4 , pp. 171-179
    • Kats, V.1    Levner, E.2
  • 68
    • 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
  • 69
    • 0032045058 scopus 로고    scopus 로고
    • Cyclic scheduling of operations for a part type in an FMS handled by a single robot: A parametric critical-path approach
    • V. Kats, and E. Levner Cyclic scheduling of operations for a part type in an FMS handled by a single robot: A parametric critical-path approach International Journal of Flexible Manufacturing Systems 10 1998 129 138
    • (1998) International Journal of Flexible Manufacturing Systems , vol.10 , pp. 129-138
    • Kats, V.1    Levner, E.2
  • 70
    • 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 2002 23 41
    • (2002) Journal of Scheduling , vol.5 , pp. 23-41
    • Kats, V.1    Levner, E.2
  • 72
    • 33845940163 scopus 로고    scopus 로고
    • A polynomial algorithm for 2-cyclic robotic scheduling
    • Gelbukh Reyes-García Springer Verlag
    • V. Kats, and E. Levner A polynomial algorithm for 2-cyclic robotic scheduling Gelbukh Reyes-García Proceedings of MICAI'06 in LNAI vol. 4293 2006 Springer Verlag 439 449
    • (2006) LNAI , vol.4293 , pp. 439-449
    • Kats, V.1    Levner, E.2
  • 73
    • 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 2009 339 355
    • (2009) Discrete Applied Mathematics , vol.157 , pp. 339-355
    • Kats, V.1    Levner, E.2
  • 76
    • 0039140289 scopus 로고
    • On an automated two-machine flowshop scheduling problem with infinite buffer
    • H. Kise On an automated two-machine flowshop scheduling problem with infinite buffer Journal of the Operations Research Society of Japan 34 3 1991 354 361
    • (1991) Journal of the Operations Research Society of Japan , vol.34 , Issue.3 , pp. 354-361
    • Kise, H.1
  • 77
    • 0026124166 scopus 로고
    • Automated two-machine flowshop scheduling: A solvable case
    • H. Kise, T. Shioyama, and T. Ibaraki Automated two-machine flowshop scheduling: A solvable case IIE Transactions 23 1 1991 10 16
    • (1991) IIE Transactions , vol.23 , Issue.1 , pp. 10-16
    • Kise, H.1    Shioyama, T.2    Ibaraki, T.3
  • 78
    • 0033360348 scopus 로고    scopus 로고
    • Cyclic scheduling in synchronous production lines
    • P. Kouvelis, and S. Karabati Cyclic scheduling in synchronous production lines IIE Transactions 31 8 1999 709 719
    • (1999) IIE Transactions , vol.31 , Issue.8 , pp. 709-719
    • Kouvelis, P.1    Karabati, S.2
  • 80
    • 21144440475 scopus 로고    scopus 로고
    • Solution of the Liu-Layland problem via bottleneck just-in-time sequencing
    • W. Kubiak Solution of the Liu-Layland problem via bottleneck just-in-time sequencing Journal of Scheduling 8 4 2005 295 302
    • (2005) Journal of Scheduling , vol.8 , Issue.4 , pp. 295-302
    • Kubiak, W.1
  • 81
    • 0033891784 scopus 로고    scopus 로고
    • Stable earliest starting schedules for cyclic job shops: A linear system approach
    • T.E. Lee Stable earliest starting schedules for cyclic job shops: A linear system approach International Journal of Flexible Manufacturing Systems 12 2000 59 80
    • (2000) International Journal of Flexible Manufacturing Systems , vol.12 , pp. 59-80
    • Lee, T.E.1
  • 82
    • 3242697916 scopus 로고    scopus 로고
    • Modelling and scheduling of ratio-driven FMS using unfolding time Petri nets
    • J. Lee, and O. Korbaa Modelling and scheduling of ratio-driven FMS using unfolding time Petri nets Computers & Industrial Engineering 46 4 2004 639 653
    • (2004) Computers & Industrial Engineering , vol.46 , Issue.4 , pp. 639-653
    • Lee, J.1    Korbaa, O.2
  • 84
    • 0030691565 scopus 로고    scopus 로고
    • Performance measures and schedules in periodic job shops
    • T.E. Lee, and M.E. Posner Performance measures and schedules in periodic job shops Operations Research 45 1 1997 72 91
    • (1997) Operations Research , vol.45 , Issue.1 , pp. 72-91
    • Lee, T.E.1    Posner, M.E.2
  • 85
    • 0027684058 scopus 로고
    • Determining the optimal starting times in a cyclic schedule with a given route
    • L. Lei Determining the optimal starting times in a cyclic schedule with a given route Computers & Operations Research 20 1993 807 816
    • (1993) Computers & Operations Research , vol.20 , pp. 807-816
    • Lei, L.1
  • 86
    • 0003569152 scopus 로고
    • A proof: The cyclic scheduling problem is NP-complete
    • Rutgers University, New Jersey
    • Lei, L., & Wang, T. J. (1989). A proof: The cyclic scheduling problem is NP-complete. Working paper no. 89-0016, Rutgers University, New Jersey.
    • (1989) Working Paper No. 89-0016
    • Lei, L.1    Wang, T.J.2
  • 87
    • 0035333368 scopus 로고    scopus 로고
    • Optimal cyclic scheduling of a robotic processing line with two-product and time-window constraints
    • L. Lei, and Q. Liu Optimal cyclic scheduling of a robotic processing line with two-product and time-window constraints INFOR 39 2 2001 185 199
    • (2001) INFOR , vol.39 , Issue.2 , pp. 185-199
    • Lei, L.1    Liu, Q.2
  • 89
    • 33646102212 scopus 로고    scopus 로고
    • An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times
    • J.M.Y. Leung, and E. Levner An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times Operations Research Letters 34 2006 465 472
    • (2006) Operations Research Letters , vol.34 , pp. 465-472
    • Leung, J.M.Y.1    Levner, E.2
  • 90
    • 0000946026 scopus 로고
    • Optimal planning of parts machining on a number of machines
    • E. Levner Optimal planning of parts machining on a number of machines Automation and Remote Control 12 1969 1972 1981
    • (1969) Automation and Remote Control , vol.12 , pp. 1972-1981
    • Levner, E.1
  • 92
    • 0000136120 scopus 로고    scopus 로고
    • A parametrical critical path problem and an application for cyclic scheduling
    • E. Levner, and V. Kats A parametrical critical path problem and an application for cyclic scheduling Discrete Applied Mathematics 87 1998 149 158
    • (1998) Discrete Applied Mathematics , vol.87 , pp. 149-158
    • Levner, E.1    Kats, V.2
  • 93
  • 94
    • 0031095268 scopus 로고    scopus 로고
    • An improved algorithm for cyclic flowshop scheduling in a robotic cell
    • PII S037722179600272X
    • E.V. Levner, V. Kats, and V. Levit An improved algorithm for cyclic flowshop scheduling in a robotic cell European Journal of Operational Research 197 1997 500 508 (Pubitemid 127418514)
    • (1997) European Journal of Operational Research , vol.97 , Issue.3 , pp. 500-508
    • Levner, E.1    Kats, V.2    Levit, V.E.3
  • 95
    • 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
  • 98
    • 70249093672 scopus 로고    scopus 로고
    • Integration of production planning and scheduling: Overview, challenges and opportunities
    • C. Maravelias, and C. Sung Integration of production planning and scheduling: Overview, challenges and opportunities Computers and Chemical Engineering 33 2009 1919 1930
    • (2009) Computers and Chemical Engineering , vol.33 , pp. 1919-1930
    • Maravelias, C.1    Sung, C.2
  • 99
    • 0025498065 scopus 로고
    • Cyclic sequencing problems in the two-machine permutation flowshop: Complexity, worst case and average case analysis
    • H. Matsuo Cyclic sequencing problems in the two-machine permutation flowshop: Complexity, worst case and average case analysis Naval Research Logistics 37 1990 679 694
    • (1990) Naval Research Logistics , vol.37 , pp. 679-694
    • Matsuo, H.1
  • 100
    • 0000197379 scopus 로고
    • A crane scheduling problem in a computer-integrated manufacturing environment
    • H. Matsuo, J.S. Shang, and R.S. Sullivan A crane scheduling problem in a computer-integrated manufacturing environment Management Science 17 1991 587 606
    • (1991) Management Science , vol.17 , pp. 587-606
    • Matsuo, H.1    Shang, J.S.2    Sullivan, R.S.3
  • 102
    • 0347559483 scopus 로고
    • The complexity of scheduling a flexible assembly system
    • University of British Columbia, Vancouver, British Columbia, Canada
    • McCormick, S. T., Pinedo, M. L., & Wolf, B. (1987). The complexity of scheduling a flexible assembly system. Working paper, University of British Columbia, Vancouver, British Columbia, Canada.
    • (1987) Working Paper
    • McCormick, S.T.1    Pinedo, M.L.2    Wolf, B.3
  • 103
    • 0024770469 scopus 로고
    • Sequencing in an assembly line with blocking to minimize cycle time
    • S.T. McCormick, M.L. Pinedo, S. Shenker, and B. Wolf Sequencing in an assembly line with blocking to minimize cycle time Operations Research 37 1989 925 935
    • (1989) Operations Research , vol.37 , pp. 925-935
    • McCormick, S.T.1    Pinedo, M.L.2    Shenker, S.3    Wolf, B.4
  • 104
    • 77955686588 scopus 로고
    • Sequencing in a flexible assembly line with blocking to minimize cycle time
    • S.T. McCormick, M.L. Pinedo, and B. Wolf Sequencing in a flexible assembly line with blocking to minimize cycle time K.E. Stecke, R. Suri, Flexible manufacturing systems 1986 Elsevier Amsterdam
    • (1986) Flexible Manufacturing Systems
    • McCormick, S.T.1    Pinedo, M.L.2    Wolf, B.3
  • 107
    • 0030173952 scopus 로고    scopus 로고
    • The complexity of a cyclic scheduling problem with identical machines and precedence constraints
    • A. Munier The complexity of a cyclic scheduling problem with identical machines and precedence constraints European Journal of Operational Research 91 1996 471 480
    • (1996) European Journal of Operational Research , vol.91 , pp. 471-480
    • Munier, A.1
  • 108
    • 0031186888 scopus 로고    scopus 로고
    • Determining the optimal move times for a given cyclic schedule of a material handling hoist
    • W.C. Ng, and J. Leung Determining the optimal move times for a given cyclic schedule of a material handling hoist Computers & Industrial Engineering 32 3 1997 595 606
    • (1997) Computers & Industrial Engineering , vol.32 , Issue.3 , pp. 595-606
    • Ng, W.C.1    Leung, J.2
  • 109
    • 84869197504 scopus 로고
    • The complexity of dynamic/periodic languages and optimization problems
    • Sloan School of Management, MIT
    • Orlin, J. B. (1985). The complexity of dynamic/periodic languages and optimization problems. Sloan working paper no. 1679-85, Sloan School of Management, MIT, .
    • (1985) Sloan Working Paper No. 1679-85
    • Orlin, J.B.1
  • 110
    • 0000763707 scopus 로고
    • Unified frameworks for optimal process planning and scheduling
    • Rippin, D. W. T. & Hale, J. (Eds.) New York
    • Pantelides, C. C. (1994). Unified frameworks for optimal process planning and scheduling, In Rippin, D. W. T. & Hale, J. (Eds.), Foundations of computer-aided process operations, New York, pp. 253-274.
    • (1994) Foundations of Computer-aided Process Operations , pp. 253-274
    • Pantelides, C.C.1
  • 111
    • 0016962332 scopus 로고
    • Mathematical programming solution of a hoist scheduling program
    • L.W. Phillips, and P.S. Unger Mathematical programming solution of a hoist scheduling program AIIE Transactions 8 2 1976 219 225
    • (1976) AIIE Transactions , vol.8 , Issue.2 , pp. 219-225
    • Phillips, L.W.1    Unger, P.S.2
  • 115
    • 0032386621 scopus 로고    scopus 로고
    • Assignments and sequencing models of the scheduling of process systems
    • J.M. Pinto, and I.E. Grossmann Assignments and sequencing models of the scheduling of process systems Annals of Operations Research 81 1998 433 466
    • (1998) Annals of Operations Research , vol.81 , pp. 433-466
    • Pinto, J.M.1    Grossmann, I.E.2
  • 116
    • 34250445958 scopus 로고
    • Optimization of stationary control of a discrete deterministic process
    • I.V. Romanovskii Optimization of stationary control of a discrete deterministic process Kybernetika (Cybernetics) 3 2 1967 66 78
    • (1967) Kybernetika (Cybernetics) , vol.3 , Issue.2 , pp. 66-78
    • Romanovskii, I.V.1
  • 118
    • 0000885127 scopus 로고
    • Cyclic schedules for job-shops with identical jobs
    • R.O. Roundy Cyclic schedules for job-shops with identical jobs Mathematics of Operations Research 17 1992 842 865
    • (1992) Mathematics of Operations Research , vol.17 , pp. 842-865
    • Roundy, R.O.1
  • 119
    • 59349109188 scopus 로고    scopus 로고
    • A quadratic algorithm for the 2-cyclic robotic scheduling problem
    • P. Sáez 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
    • Sáez, P.1
  • 123
    • 0032042832 scopus 로고    scopus 로고
    • Petri net modeling and scheduling for cyclic job shops with blocking
    • J.-S. Song, and T.-E. Lee Petri net modeling and scheduling for cyclic job shops with blocking Computers & Industrial Engineering 34 2 1998 281 295
    • (1998) Computers & Industrial Engineering , vol.34 , Issue.2 , pp. 281-295
    • Song, J.-S.1    Lee, T.-E.2
  • 124
    • 17444428658 scopus 로고    scopus 로고
    • Scheduling in re-entrant robotic cells: Algorithms and complexity
    • Steiner, and Z. Xue Scheduling in re-entrant robotic cells: Algorithms and complexity Journal of Scheduling 8 2005 25 48
    • (2005) Journal of Scheduling , vol.8 , pp. 25-48
    • Steiner1    Xue, Z.2
  • 125
    • 41549163260 scopus 로고    scopus 로고
    • Deadline constrained cyclic scheduling on pipelined dedicated processors considering multiprocessor tasks and changeover times
    • P. Sucha, and Z. Hanzalek Deadline constrained cyclic scheduling on pipelined dedicated processors considering multiprocessor tasks and changeover times Mathematical and Computer Modelling 47 2008 925 942
    • (2008) Mathematical and Computer Modelling , vol.47 , pp. 925-942
    • Sucha, P.1    Hanzalek, Z.2
  • 127
    • 0042683979 scopus 로고
    • A scheduling problem for a flowshop line with a single operator
    • V.S. Tanaev A scheduling problem for a flowshop line with a single operator Engineering Physical Journal 7 3 1964 111 114 (in Russian)
    • (1964) Engineering Physical Journal , vol.7 , Issue.3 , pp. 111-114
    • Tanaev, V.S.1
  • 128
    • 72249111532 scopus 로고    scopus 로고
    • A cyclic approach to large-scale short-term planning in chemical batch production
    • N. Trautmann, and C. Schwindt A cyclic approach to large-scale short-term planning in chemical batch production Journal of Scheduling 12 2009 595 606
    • (2009) Journal of Scheduling , vol.12 , pp. 595-606
    • Trautmann, N.1    Schwindt, C.2
  • 130
    • 4143112202 scopus 로고    scopus 로고
    • Cyclic short-term scheduling of multiproduct batch plants using continuous-time representation
    • D. Wu, and M. Ierapetritou Cyclic short-term scheduling of multiproduct batch plants using continuous-time representation Computers and Chemical Engineering 28 2004 2271 2286
    • (2004) Computers and Chemical Engineering , vol.28 , pp. 2271-2286
    • Wu, D.1    Ierapetritou, M.2


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