메뉴 건너뛰기
Computers and Operations Research
Volumn 35, Issue 3, 2008, Pages 876-883
A two-machine flowshop scheduling problem with a separated maintenance constraint
Author keywords

Flowshop scheduling; Heuristic algorithm; Maintenance
Indexed keywords

COMPUTATIONAL EFFICIENCY; CONSTRAINT THEORY; HEURISTIC ALGORITHMS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;
EID: 34548454869     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.04.007     Document Type: Article
Times cited : (41)
References (8)
  • 1
    • 0003075019 scopus 로고
    • Optimal two- and three-stage production schedules with setup times included
    • Johnson S.M. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1 (1954) 61-68
    • (1954) Naval Research Logistics Quarterly , vol.1 , pp. 61-68
    • Johnson, S.M.1
  • 2
    • 0018520161 scopus 로고
    • Optimal two-stage production scheduling with setup times separated
    • Yoshida T., and Hitomi K. Optimal two-stage production scheduling with setup times separated. AIIE Transactions 11 (1979) 261-263
    • (1979) AIIE Transactions , vol.11 , pp. 261-263
    • Yoshida, T.1    Hitomi, K.2
  • 3
    • 0020816005 scopus 로고
    • Sequency on two and three machines with setup, processing and removal times separated
    • Sule D., and Huang K.Y. Sequency on two and three machines with setup, processing and removal times separated. International Journal of Production Research 21 (1983) 723-732
    • (1983) International Journal of Production Research , vol.21 , pp. 723-732
    • Sule, D.1    Huang, K.Y.2
  • 4
    • 0041763613 scopus 로고
    • On 2 × n sequencing problem with transportation times of jobs
    • Maggu P.L., and Das G. On 2 × n sequencing problem with transportation times of jobs. Pure and Applied Mathematika Sciences 12 (1980) 1-6
    • (1980) Pure and Applied Mathematika Sciences , vol.12 , pp. 1-6
    • Maggu, P.L.1    Das, G.2
  • 5
    • 0009438549 scopus 로고
    • Two- and three-machine flow-shop makespan scheduling problems with additional times separated from processing times
    • Nabeshima I., and Maruyama S. Two- and three-machine flow-shop makespan scheduling problems with additional times separated from processing times. Journal of the Operations Research Society of Japan 27 (1984) 348-366
    • (1984) Journal of the Operations Research Society of Japan , vol.27 , pp. 348-366
    • Nabeshima, I.1    Maruyama, S.2
  • 6
    • 0000049036 scopus 로고    scopus 로고
    • Minimizing the makespan in the two-machine flowshop scheduling problem with availability constraint
    • Lee C.Y. Minimizing the makespan in the two-machine flowshop scheduling problem with availability constraint. Operations Research Letters 20 (1997) 129-139
    • (1997) Operations Research Letters , vol.20 , pp. 129-139
    • Lee, C.Y.1
  • 7
    • 0029343965 scopus 로고
    • Two-stage production scheduling with separated setup times and stochastic breakdowns
    • Allahverdi A. Two-stage production scheduling with separated setup times and stochastic breakdowns. Journal of the Operational Research Society 46 (1995) 896-904
    • (1995) Journal of the Operational Research Society , vol.46 , pp. 896-904
    • Allahverdi, A.1
  • 8
    • 0031258858 scopus 로고    scopus 로고
    • Scheduling in stochastic flowshops with independent setup, processing and removal times
    • Allahverdi A. Scheduling in stochastic flowshops with independent setup, processing and removal times. Computers and Operations Research 24 (1997) 955-960
    • (1997) Computers and Operations Research , vol.24 , pp. 955-960
    • Allahverdi, A.1

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