메뉴 건너뛰기




Volumn 3, Issue 2, 2009, Pages 199-210

Due date assignment for multistage assembly systems

Author keywords

Assembly systems; Markov processes; Queueing; Simulation

Indexed keywords

AGGREGATE COSTS; ASSEMBLY SYSTEMS; COMPLETION TIME; DISTRIBUTED PROCESSING; DUE DATES; DUE-DATE ASSIGNMENTS; ERLANG DISTRIBUTIONS; LEAD-TIME; LINEAR FUNCTIONS; LONGEST PATHS; MANUFACTURING LEAD-TIME; MONTE CARLO SIMULATIONS; OPEN QUEUEING NETWORKS; OPTIMAL CONSTANTS; PENALTY COSTS; POISSON PROCESS; PRODUCT ORDERS; QUEUEING; SIMULATION; TIME OF DELIVERIES; TRANSPORT TIME;

EID: 64949115456     PISSN: 18624472     EISSN: 18624480     Source Type: Journal    
DOI: 10.1007/s11590-008-0101-x     Document Type: Article
Times cited : (5)

References (23)
  • 2
    • 15244342527 scopus 로고    scopus 로고
    • Distribution function of the shortest path in networks of queues
    • 10.1007/s00291-004-0169-3
    • A. Azaron M. Modarres 2005 Distribution function of the shortest path in networks of queues OR Spectrum 27 123 144 10.1007/s00291-004-0169-3
    • (2005) OR Spectrum , vol.27 , pp. 123-144
    • Azaron, A.1    Modarres, M.2
  • 3
    • 33845297328 scopus 로고    scopus 로고
    • Modelling complex assemblies as a queueing network for lead time control
    • 10.1016/j.ejor.2005.01.025
    • A. Azaron H. Katagiri K. Kato M. Sakawa 2006 Modelling complex assemblies as a queueing network for lead time control Eur. J. Oper. Res. 174 150 168 10.1016/j.ejor.2005.01.025
    • (2006) Eur. J. Oper. Res. , vol.174 , pp. 150-168
    • Azaron, A.1    Katagiri, H.2    Kato, K.3    Sakawa, M.4
  • 4
    • 0037449052 scopus 로고    scopus 로고
    • Optimal control of service rates and arrivals in Jackson networks
    • 10.1016/S0377-2217(02)00177-7
    • A. Azaron S.M.T. Fatemi Ghomi 2003 Optimal control of service rates and arrivals in Jackson networks Eur. J. Oper. Res. 147 17 31 10.1016/S0377-2217(02) 00177-7
    • (2003) Eur. J. Oper. Res. , vol.147 , pp. 17-31
    • Azaron, A.1    Fatemi Ghomi, S.M.T.2
  • 5
    • 0005350580 scopus 로고
    • Critical path analysis via chance constrained and stochastic programming
    • A. Charnes W. Cooper G. Thompson 1964 Critical path analysis via chance constrained and stochastic programming Oper. Res. 12 460 470
    • (1964) Oper. Res. , vol.12 , pp. 460-470
    • Charnes, A.1    Cooper, W.2    Thompson, G.3
  • 6
    • 0024303531 scopus 로고
    • Survey of scheduling research involving due date determination decisions
    • 10.1016/0377-2217(89)90100-8
    • T.C.E. Cheng M.C. Gupta 1989 Survey of scheduling research involving due date determination decisions Eur. J. Oper. Res. 38 156 166 10.1016/0377-2217(89) 90100-8
    • (1989) Eur. J. Oper. Res. , vol.38 , pp. 156-166
    • Cheng, T.C.E.1    Gupta, M.C.2
  • 7
    • 0033888813 scopus 로고    scopus 로고
    • Optimal start time under stochastic activity durations
    • 10.1016/S0925-5273(99)00054-7
    • S.E. Elmaghraby A.A. Ferreira L.V. Tavares 2000 Optimal start time under stochastic activity durations Int. J. Prod. Econ. 64 153 164 10.1016/S0925-5273(99)00054-7
    • (2000) Int. J. Prod. Econ. , vol.64 , pp. 153-164
    • Elmaghraby, S.E.1    Ferreira, A.A.2    Tavares, L.V.3
  • 8
    • 0032286478 scopus 로고    scopus 로고
    • A Markovian single server with upstream job and downstream demand arrival stream
    • 10.1023/A:1019137626073
    • H. Gold 1998 A Markovian single server with upstream job and downstream demand arrival stream Queueing Syst. 30 435 455 10.1023/A:1019137626073
    • (1998) Queueing Syst. , vol.30 , pp. 435-455
    • Gold, H.1
  • 9
    • 0000102664 scopus 로고
    • Assembly-like queues
    • 10.2307/3212352
    • J.M. Harrison 1973 Assembly-like queues J. Appl. Probab. 10 354 367 10.2307/3212352
    • (1973) J. Appl. Probab. , vol.10 , pp. 354-367
    • Harrison, J.M.1
  • 10
    • 0037063278 scopus 로고    scopus 로고
    • Modelling flow and jobbing shops as a queueing network for workload control
    • 10.1016/S0925-5273(01)00117-7
    • A. Haskose B.G. Kingsman D. Worthington 2002 Modelling flow and jobbing shops as a queueing network for workload control Int. J. Prod. Econ. 78 271 285 10.1016/S0925-5273(01)00117-7
    • (2002) Int. J. Prod. Econ. , vol.78 , pp. 271-285
    • Haskose, A.1    Kingsman, B.G.2    Worthington, D.3
  • 11
    • 0037395315 scopus 로고    scopus 로고
    • Performance analysis and buffer allocations in some open assembly systems
    • 10.1016/S0305-0548(02)00034-5
    • N. Hemachandra S.K. Eedupuganti 2003 Performance analysis and buffer allocations in some open assembly systems Comput. Oper. Res. 30 695 704 10.1016/S0305-0548(02)00034-5
    • (2003) Comput. Oper. Res. , vol.30 , pp. 695-704
    • Hemachandra, N.1    Eedupuganti, S.K.2
  • 12
    • 0017944560 scopus 로고
    • Steady state waiting time in a multicenter job shop
    • 10.1002/nav.3800250112
    • A.S. Kapadia B.P. His 1978 Steady state waiting time in a multicenter job shop Nav. Res. Logistics Q. 25 149 154 10.1002/nav.3800250112
    • (1978) Nav. Res. Logistics Q. , vol.25 , pp. 149-154
    • Kapadia, A.S.1    His, B.P.2
  • 13
    • 0022785024 scopus 로고
    • Markov and Markov-regenerative PERT networks
    • V. Kulkarni V. Adlakha 1986 Markov and Markov-regenerative PERT networks Oper. Res. 34 769 781
    • (1986) Oper. Res. , vol.34 , pp. 769-781
    • Kulkarni, V.1    Adlakha, V.2
  • 14
    • 0002485078 scopus 로고
    • Assembly-like queues with finite capacity: Bounds, asympototics and approximations
    • 10.1007/BF01149328
    • E.H. Lipper B. Sengupta 1986 Assembly-like queues with finite capacity: bounds, asympototics and approximations Queueing Syst. 1 67 83 10.1007/BF01149328
    • (1986) Queueing Syst. , vol.1 , pp. 67-83
    • Lipper, E.H.1    Sengupta, B.2
  • 15
    • 0003107787 scopus 로고
    • Distribution of the time through a directed acyclic network
    • J. Martin 1965 Distribution of the time through a directed acyclic network Oper. Res. 13 46 66
    • (1965) Oper. Res. , vol.13 , pp. 46-66
    • Martin, J.1
  • 16
    • 0030570340 scopus 로고    scopus 로고
    • Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines
    • 10.1016/0377-2217(95)00378-9
    • H.T. Papadopoulos C. Heavey 1996 Queueing theory in manufacturing systems analysis and design: a classification of models for production and transfer lines Eur. J. Oper. Res. 92 1 27 10.1016/0377-2217(95)00378-9
    • (1996) Eur. J. Oper. Res. , vol.92 , pp. 1-27
    • Papadopoulos, H.T.1    Heavey, C.2
  • 17
    • 0019560165 scopus 로고
    • Due date assignment for production systems
    • A. Seidman M.L. Smith 1981 Due date assignment for production systems Manage. Sci. 27 571 581
    • (1981) Manage. Sci. , vol.27 , pp. 571-581
    • Seidman, A.1    Smith, M.L.2
  • 18
    • 0024064120 scopus 로고
    • Approximations for the time spent in a dynamic job shop with application to due-date assignment
    • 10.1080/00207548808947949
    • J.G. Shanthikumar U. Sumita 1988 Approximations for the time spent in a dynamic job shop with application to due-date assignment Int. J. Prod. Res. 26 1329 1352 10.1080/00207548808947949
    • (1988) Int. J. Prod. Res. , vol.26 , pp. 1329-1352
    • Shanthikumar, J.G.1    Sumita, U.2
  • 19
    • 0037061532 scopus 로고    scopus 로고
    • Product due date assignment for complex assemblies
    • 10.1016/S0925-5273(01)00170-0
    • D.P. Song C. Hicks C.F. Earl 2002 Product due date assignment for complex assemblies Int. J. Prod. Econ. 76 243 256 10.1016/S0925-5273(01)00170-0
    • (2002) Int. J. Prod. Econ. , vol.76 , pp. 243-256
    • Song, D.P.1    Hicks, C.2    Earl, C.F.3
  • 20
    • 0033102034 scopus 로고    scopus 로고
    • Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
    • 10.1016/S0377-2217(98)00003-4
    • H.M. Soroush 1999 Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs Eur. J. Oper. Res. 113 450 468 10.1016/S0377-2217(98)00003-4
    • (1999) Eur. J. Oper. Res. , vol.113 , pp. 450-468
    • Soroush, H.M.1
  • 21
    • 0036165544 scopus 로고    scopus 로고
    • An open queueing network for lead time analysis
    • N. Vandaele L.D. Boeck D. Callewier 2002 An open queueing network for lead time analysis IIE Trans. 34 1 9
    • (2002) IIE Trans. , vol.34 , pp. 1-9
    • Vandaele, N.1    Boeck, L.D.2    Callewier, D.3
  • 23
    • 0023558979 scopus 로고
    • Stochastic lead-time in two-level assembly systems
    • 10.1080/07408178708975409
    • C.A. Yano 1987 Stochastic lead-time in two-level assembly systems IIE Trans. 19 371 378 10.1080/07408178708975409
    • (1987) IIE Trans. , vol.19 , pp. 371-378
    • Yano, C.A.1


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