메뉴 건너뛰기
Naval Research Logistics
Volumn 48, Issue 4, 2001, Pages 293-298
Multiple common due dates
Author keywords

Due date; Productions; Scheduling
Indexed keywords

JOB ANALYSIS; PROBLEM SOLVING; PRODUCTION; TIME AND MOTION STUDY;
EID: 0035371766     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/nav.9     Document Type: Article
Times cited : (7)
References (10)
  • 1
    • 0025211593 scopus 로고
    • Sequencing with earliness and tardiness penalties: A review
    • K.R. Baker and G.D. Scudder, Sequencing with earliness and tardiness penalties: A review, Oper Res 38 (1990), 22-36.
    • (1990) Oper Res , vol.38 , pp. 22-36
    • Baker, K.R.1    Scudder, G.D.2
  • 2
    • 84974859431 scopus 로고
    • A heuristic for common due-date assignment and job scheduling on parallel machines
    • T.C.E. Cheng, A heuristic for common due-date assignment and job scheduling on parallel machines, J Oper Res Soc 40 (1989), 1129-1135.
    • (1989) J Oper Res Soc , vol.40 , pp. 1129-1135
    • Cheng, T.C.E.1
  • 3
    • 0028445470 scopus 로고
    • Parallel machine scheduling problems with earliness and tardiness penalties
    • T.C.E. Cheng and Z.L. Chen, Parallel machine scheduling problems with earliness and tardiness penalties, J Oper Res Soc 45 (1994), 685-695.
    • (1994) J Oper Res Soc , vol.45 , pp. 685-695
    • Cheng, T.C.E.1    Chen, Z.L.2
  • 4
    • 0024303531 scopus 로고
    • Survey of scheduling research involving due date determination decisions
    • T.C.E. Cheng and M.C. Gupta, Survey of scheduling research involving due date determination decisions, Eur J Oper Res 38 (1989), 156-166.
    • (1989) Eur J Oper Res , vol.38 , pp. 156-166
    • Cheng, T.C.E.1    Gupta, M.C.2
  • 5
    • 0023531467 scopus 로고
    • Scheduling to a common due date on parallel uniform processors
    • H. Emmons, Scheduling to a common due date on parallel uniform processors, Nav Res Logistics Quart 34 (1987), 803-810.
    • (1987) Nav Res Logistics Quart , vol.34 , pp. 803-810
    • Emmons, H.1
  • 6
    • 0001155594 scopus 로고    scopus 로고
    • Heuristics for multimachine scheduling problems with earliness and tardiness costs
    • A. Federgruen and G. Mosheiov, Heuristics for multimachine scheduling problems with earliness and tardiness costs, Manage Sci 42 (1996), 1544-1555.
    • (1996) Manage Sci , vol.42 , pp. 1544-1555
    • Federgruen, A.1    Mosheiov, G.2
  • 7
    • 0002393136 scopus 로고
    • Single and multiple processor models for minimizing completion time variance
    • N.G. Hall, Single and multiple processor models for minimizing completion time variance, Nav Res Logistics Quart 33 (1986), 49-54.
    • (1986) Nav Res Logistics Quart , vol.33 , pp. 49-54
    • Hall, N.G.1
  • 8
    • 0020103079 scopus 로고
    • Common due-date assignment to minimize total penalty for the one machine scheduling problem
    • S.S. Panwalker, M.L. Smith, and A. Seidmann, Common due-date assignment to minimize total penalty for the one machine scheduling problem. Oper Res 30 (1982), 391-399.
    • (1982) Oper Res , vol.30 , pp. 391-399
    • Panwalker, S.S.1    Smith, M.L.2    Seidmann, A.3
  • 9
    • 0021439811 scopus 로고
    • Minimizing the sum of absolute lateness in single machine and multimachine scheduling
    • P.S. Sundararaghavan and M.U. Ahmed, Minimizing the sum of absolute lateness in single machine and multimachine scheduling, Nav Res Logistics Quart 31 (1984), 325-333.
    • (1984) Nav Res Logistics Quart , vol.31 , pp. 325-333
    • Sundararaghavan, P.S.1    Ahmed, M.U.2
  • 10
    • 0030395652 scopus 로고    scopus 로고
    • Optimal common due-date with completion time tolerance
    • Y. Wilamowsky, S. Epstein, and B.H. Dickman, Optimal common due-date with completion time tolerance, Comp Oper Res 23 (1996), 1203-1210.
    • (1996) Comp Oper Res , vol.23 , pp. 1203-1210
    • Wilamowsky, Y.1    Epstein, S.2    Dickman, B.H.3

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