메뉴 건너뛰기




Volumn 18, Issue 1, 2002, Pages 69-80

Multicyclic hoist scheduling with constant processing times

Author keywords

Algorithms; Production systems; Scheduling

Indexed keywords

BRANCH AND BOUND ALGORITHMS; CYCLE TIME; FORBIDDEN INTERVALS; LINEAR PROGRAMMING PROBLEM; MULTICYCLIC SCHEDULING; PRODUCTION SYSTEMS; PROHIBITED INTERVALS;

EID: 0036476753     PISSN: 1042296X     EISSN: None     Source Type: Journal    
DOI: 10.1109/70.988976     Document Type: Article
Times cited : (87)

References (19)
  • 12
    • 0003569152 scopus 로고
    • A proof: The cyclic hoist scheduling problem is NP-hard
    • Rutgers Univ., Working Paper #89-0016
    • (1989)
    • Lei, L.1    Wang, T.J.2
  • 13
    • 0028396353 scopus 로고
    • Determining optimal cyclic hoist schedules in a single-hoist electroplating line
    • Mar.
    • (1994) IIE Trans. , vol.26 , pp. 25-33
    • Lei, L.1    Wang, T.J.2


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