메뉴 건너뛰기




Volumn 51, Issue 4, 2003, Pages 585-601

Operations and shipment scheduling of a batch on a flexible machine

Author keywords

Production scheduling, approximation heuristic: flexible machine scheduling; Transportation, scheduling: integrated production and transportation model

Indexed keywords

FLEXIBLE MACHINES; MACHINING OPERATIONS; QUEUEING SETTINGS; SHIPMENTS;

EID: 4344705661     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.51.4.585.16095     Document Type: Article
Times cited : (6)

References (11)
  • 2
    • 0028550884 scopus 로고
    • Single-visit polices for allocating a single resource in a stochastic environment
    • Benkherouf, L., K. D. Glazebrook, W. Owen. 1994. Single-visit polices for allocating a single resource in a stochastic environment. Oper. Res. 42 1087-1099.
    • (1994) Oper. Res. , vol.42 , pp. 1087-1099
    • Benkherouf, L.1    Glazebrook, K.D.2    Owen, W.3
  • 3
    • 0032027344 scopus 로고    scopus 로고
    • Control of a single-server tandem queueing system with setups
    • Duenyas, I., D. Gupta, T. M. Lennon. 1998. Control of a single-server tandem queueing system with setups. Oper. Res. 46 218-230.
    • (1998) Oper. Res. , vol.46 , pp. 218-230
    • Duenyas, I.1    Gupta, D.2    Lennon, T.M.3
  • 4
    • 4344702543 scopus 로고
    • On stochastic scheduling with precedence relations and switching costs
    • Glazebrook, K. D. 1980. On stochastic scheduling with precedence relations and switching costs. J. Appl. Probab. 17 1016-1024.
    • (1980) J. Appl. Probab. , vol.17 , pp. 1016-1024
    • Glazebrook, K.D.1
  • 5
    • 0029379103 scopus 로고
    • A suboptimality bound for permutation policies in single machine stochastic scheduling
    • _. 1995. A suboptimality bound for permutation policies in single machine stochastic scheduling. Naval Res. Logist. 42 993-1006.
    • (1995) Naval Res. Logist. , vol.42 , pp. 993-1006
  • 7
    • 0031314299 scopus 로고    scopus 로고
    • A two-stage tandem queue attended by a moving server with holding and switching costs
    • Iravani, S. M. R., M. J. M. Posner, J. A. Buzacott. 1997. A two-stage tandem queue attended by a moving server with holding and switching costs. Queueing Systems 26 203-228.
    • (1997) Queueing Systems , vol.26 , pp. 203-228
    • Iravani, S.M.R.1    Posner, M.J.M.2    Buzacott, J.A.3
  • 8
    • 0016483826 scopus 로고
    • Decomposition algorithms for single-machine sequencing with precedence relations and deferral costs
    • Sidney, J. B. 1975. Decomposition algorithms for single-machine sequencing with precedence relations and deferral costs. Oper. Res. 23 283-298.
    • (1975) Oper. Res. , vol.23 , pp. 283-298
    • Sidney, J.B.1
  • 11
    • 0008550960 scopus 로고
    • Optimal stochastic scheduling of forest networks with switching penalties
    • Van Oyen M. P., D. Teneketzis. 1994. Optimal stochastic scheduling of forest networks with switching penalties. Adv. Appl. Probab. 26 474-497.
    • (1994) Adv. Appl. Probab. , vol.26 , pp. 474-497
    • Van Oyen, M.P.1    Teneketzis, D.2


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