메뉴 건너뛰기




Volumn 167, Issue 2, 2005, Pages 1430-1450

Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert

Author keywords

Idle insert; Maximum earliness; Maximum tardiness; Scheduling; Single machine

Indexed keywords

ALGORITHMS; FUNCTIONS; JUST IN TIME PRODUCTION;

EID: 25144495566     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2004.08.022     Document Type: Article
Times cited : (28)

References (16)
  • 3
    • 0030214652 scopus 로고    scopus 로고
    • A simulated annealing approach for the one-machine mean tardiness scheduling problem
    • M. Ben-daya, and M. Al-fawzan A simulated annealing approach for the one-machine mean tardiness scheduling problem European Journal of Operational Research 93 1996 61 67
    • (1996) European Journal of Operational Research , vol.93 , pp. 61-67
    • Ben-Daya, M.1    Al-Fawzan, M.2
  • 4
    • 85042571237 scopus 로고
    • One-machine sequencing to minimize certain function of job tardiness
    • H. Emmons One-machine sequencing to minimize certain function of job tardiness Operation Research 17 1969 605 612
    • (1969) Operation Research , vol.17 , pp. 605-612
    • Emmons, H.1
  • 5
    • 0026205623 scopus 로고
    • On the single-machine scheduling problem with tardiness penalties
    • T. Sen, and B.N. Borah On the single-machine scheduling problem with tardiness penalties Journal of the Operational Research Society 42 1991 695 702
    • (1991) Journal of the Operational Research Society , vol.42 , pp. 695-702
    • Sen, T.1    Borah, B.N.2
  • 6
  • 8
    • 0031186844 scopus 로고    scopus 로고
    • A tabu search approach for the single machine mean tardiness problem
    • A. Islam, and M. Oksioglu A tabu search approach for the single machine mean tardiness problem Journal of the Operational Research Society 48 1997 751 755
    • (1997) Journal of the Operational Research Society , vol.48 , pp. 751-755
    • Islam, A.1    Oksioglu, M.2
  • 9
    • 0000245614 scopus 로고
    • The single machine early/tardy problem
    • P.S. Ow, and T.E. Morton The single machine early/tardy problem Management Science 35 1989 177 191
    • (1989) Management Science , vol.35 , pp. 177-191
    • Ow, P.S.1    Morton, T.E.2
  • 10
    • 0000230214 scopus 로고
    • A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem
    • S.H. Zegordi, K. Itoh, and T. Enkawa A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem International Journal of Production Research 33 1995 1449 1466
    • (1995) International Journal of Production Research , vol.33 , pp. 1449-1466
    • Zegordi, S.H.1    Itoh, K.2    Enkawa, T.3
  • 11
    • 0026158109 scopus 로고
    • Algorithms for a class of single-machine weighted tardiness and earliness problems
    • C.A. Yano, and Y.D. Kim Algorithms for a class of single-machine weighted tardiness and earliness problems European Journal of Operational Research 52 1991 167 175
    • (1991) European Journal of Operational Research , vol.52 , pp. 167-175
    • Yano, C.A.1    Kim, Y.D.2
  • 12
    • 84977334714 scopus 로고
    • Optimal timing schedules in earliness-tardiness single machine sequencing
    • W. Szwarc, and S.K. Mukhopadhyay Optimal timing schedules in earliness-tardiness single machine sequencing Naval Research Logistics 42 1995 1109 1114
    • (1995) Naval Research Logistics , vol.42 , pp. 1109-1114
    • Szwarc, W.1    Mukhopadhyay, S.K.2
  • 13
    • 0027540836 scopus 로고
    • Common due date scheduling problem with separate earliness and tardiness penalties
    • P. Dileepan Common due date scheduling problem with separate earliness and tardiness penalties Computer and Operational Research 20 1993 179 184
    • (1993) Computer and Operational Research , vol.20 , pp. 179-184
    • Dileepan, P.1
  • 14
    • 0031268318 scopus 로고    scopus 로고
    • A neighborhood scheme with a compressed solution space for the early/tardy scheduling problem
    • R.J.W. James, and J.T. Buchanan A neighborhood scheme with a compressed solution space for the early/tardy scheduling problem European Journal of Operational Research 102 1997 513 527
    • (1997) European Journal of Operational Research , vol.102 , pp. 513-527
    • James, R.J.W.1    Buchanan, J.T.2
  • 16
    • 0028734441 scopus 로고
    • Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due date
    • Y.D. Kim, and C.A. Yano Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due date Naval Research Logistics 41 1994 913 933
    • (1994) Naval Research Logistics , vol.41 , pp. 913-933
    • Kim, Y.D.1    Yano, C.A.2


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