메뉴 건너뛰기




Volumn 101, Issue 1 SPEC. ISS., 2006, Pages 19-29

A heuristic job-shop scheduling algorithm to minimize the total holding cost of completed and in-process products subject to no tardy jobs

Author keywords

Due date constraints; Heuristics; Holding cost; Job shop scheduling; Shifting bottleneck procedure

Indexed keywords

ALGORITHMS; BENCHMARKING; CONSTRAINT THEORY; COSTS; HEURISTIC METHODS; PRODUCT DESIGN;

EID: 29344441455     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2005.05.004     Document Type: Article
Times cited : (24)

References (12)
  • 1
    • 0023977010 scopus 로고
    • The sifting bottleneck procedure for job shop scheduling problem
    • J. Adams, E. Balas, and D. Zawack The sifting bottleneck procedure for job shop scheduling problem Management Science 34 1988 391 401
    • (1988) Management Science , vol.34 , pp. 391-401
    • Adams, J.1    Balas, E.2    Zawack, D.3
  • 3
    • 0026126118 scopus 로고
    • A computation study of the job-shop scheduling problem
    • D. Applegate, and W. Cook A computation study of the job-shop scheduling problem ORSA Journal on Computing 3 1991 149 156
    • (1991) ORSA Journal on Computing , vol.3 , pp. 149-156
    • Applegate, D.1    Cook, W.2
  • 4
    • 0030170675 scopus 로고    scopus 로고
    • Single machine scheduling using dominance relation to minimize earliness subject to ready and due times
    • M. Asano, and H. Ohta Single machine scheduling using dominance relation to minimize earliness subject to ready and due times International Journal of Production Economics 44 1996 35 43
    • (1996) International Journal of Production Economics , vol.44 , pp. 35-43
    • Asano, M.1    Ohta, H.2
  • 5
    • 0000165767 scopus 로고
    • An algorithm for solving the job-shop problem
    • J. Carlier, and E. Pinson An algorithm for solving the job-shop problem Management Science 35 1989 164 176
    • (1989) Management Science , vol.35 , pp. 164-176
    • Carlier, J.1    Pinson, E.2
  • 12
    • 0023399009 scopus 로고
    • Priority rules for job shops with weighted tardiness costs
    • A.P.J. Vepsalainen, and T.E. Morton Priority rules for job shops with weighted tardiness costs Management Science 33 1987 1035 1047
    • (1987) Management Science , vol.33 , pp. 1035-1047
    • Vepsalainen, A.P.J.1    Morton, T.E.2


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