메뉴 건너뛰기




Volumn 45, Issue 1, 1998, Pages 99-113

Single machine sequencing with linear models of release dates

Author keywords

Linear models; Minimization of the maximum completion time; Release dates; Single machine sequencing

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; HOT ROLLING; IRON AND STEEL PLANTS; JOB ANALYSIS; NONLINEAR PROGRAMMING; POLYNOMIALS; PREHEATING; PROCESS ENGINEERING; RESOURCE ALLOCATION;

EID: 0031999371     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6750(199802)45:1<99::AID-NAV6>3.0.CO;2-G     Document Type: Article
Times cited : (21)

References (8)
  • 1
    • 0000474126 scopus 로고
    • Minimizing Total Tardiness on One Machine is NP-Hard
    • Du, J., and Leung, J.Y.-T., "Minimizing Total Tardiness on One Machine is NP-Hard," Mathematics of Operations Research, 15, 483-495 (1990).
    • (1990) Mathematics of Operations Research , vol.15 , pp. 483-495
    • Du, J.1    Leung, J.Y.-T.2
  • 5
    • 0026203180 scopus 로고
    • Single Machine Scheduling Problem with a Common Deadline and Resource Dependent Release Dates
    • Janiak, A., "Single Machine Scheduling Problem with a Common Deadline and Resource Dependent Release Dates," European Journal of Operational Research, 53, 317-325 (1991).
    • (1991) European Journal of Operational Research , vol.53 , pp. 317-325
    • Janiak, A.1


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