메뉴 건너뛰기




Volumn 47, Issue 2, 2001, Pages 264-279

Scheduling and reliable lead-time quotation for orders with availability intervals and lead-time sensitive revenues

Author keywords

Competitive Ratio; Complexity; Lead Time Quotation; Online Algorithms; Scheduling

Indexed keywords

ALGORITHMS; CUSTOMER SATISFACTION; DECISION MAKING; ONLINE SYSTEMS; SCHEDULING;

EID: 0035261939     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.47.2.264.9836     Document Type: Article
Times cited : (94)

References (34)
  • 2
  • 4
    • 0002009274 scopus 로고
    • A dynamic priority rule for scheduling against due-dates
    • (1982) J. Oper. Management , vol.3 , Issue.1 , pp. 37-42
  • 8
    • 0001018014 scopus 로고
    • A single machine model for determination of optimal due dates and sequence
    • (1992) Oper. Res. , vol.40 , Issue.3 , pp. 596-602
    • Chand, S.1    Chhajed, D.2
  • 12
    • 0001131108 scopus 로고
    • Single facility due date setting with multiple customer classes
    • (1995) Management Sci. , vol.41 , Issue.4 , pp. 608-619
    • Duenyas, I.1
  • 33
    • 0001200692 scopus 로고
    • Due-date setting and priority sequencing in a multi-class M/G/1 queue
    • (1991) Management Sci. , vol.57 , Issue.7 , pp. 834-851
    • Wein, L.M.1


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