메뉴 건너뛰기




Volumn 38, Issue 7, 2011, Pages 7911-7918

A genetic algorithm for JIT single machine scheduling with preemption and machine idle time

Author keywords

Genetic algorithm; Just in time scheduling; Machine idle time; Preemption; Single machine

Indexed keywords

INTEGER VARIABLES; JUST IN TIME; JUST-IN-TIME SCHEDULING; LARGE SIZES; MACHINE IDLE; MACHINE IDLE TIME; NEW MODEL; NON-LINEAR; NP-HARDNESS; NUMERICAL EXAMPLE; OPTIMAL SOLUTIONS; PREEMPTION; SINGLE MACHINE; SINGLE MACHINE SCHEDULING PROBLEMS; SINGLE-MACHINE SCHEDULING; TEST PROBLEM;

EID: 79952374357     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2010.10.066     Document Type: Article
Times cited : (37)

References (21)
  • 3
    • 0025211593 scopus 로고
    • Sequencing with earliness and tardiness penalties. A review
    • K.R. Baker, and G. Scudder Sequencing with earliness and tardiness penalties: A review Operations Research 38 1990 22 36 (Pubitemid 20674472)
    • (1990) Operations Research , vol.38 , Issue.1 , pp. 22-36
    • Baker Kenneth, R.1    Scudder Gary, D.2
  • 4
    • 34848912819 scopus 로고    scopus 로고
    • Preemption in single machine earliness/tardiness scheduling
    • DOI 10.1007/s10951-007-0028-6
    • K. Bülbül, P. Kaminsky, and C. Yano Preemption in single machine earliness/tardiness scheduling Journal of Scheduling 10 2007 271 292 (Pubitemid 47501050)
    • (2007) Journal of Scheduling , vol.10 , Issue.4-5 , pp. 271-292
    • Bulbul, K.1    Kaminsky, P.2    Yano, C.3
  • 5
    • 0027542554 scopus 로고
    • Single-machine scheduling with early and tardy completion costs
    • J.S. Davis, and J.J. Kanet Single-machine scheduling with early and tardy completion costs Naval Research Logistics 40 1993 85 101 (Pubitemid 23695478)
    • (1993) Naval Research Logistics , vol.40 , Issue.1 , pp. 85-101
    • Davis J.Steve1    Kanet John, J.2
  • 7
    • 0037118177 scopus 로고    scopus 로고
    • A survey of the state-of-the-art of common due date assignment and scheduling research
    • DOI 10.1016/S0377-2217(01)00181-3, PII S0377221701001813
    • V. Gordon, J.M. Proth, and C. Chu A survey of the state of the art of common due date assignment and scheduling research European Journal of Operational Research 139 2002 1 25 (Pubitemid 34153934)
    • (2002) European Journal of Operational Research , vol.139 , Issue.1 , pp. 1-25
    • Gordon, V.1    Proth, J.-M.2    Chu, C.3
  • 8
    • 56249099657 scopus 로고    scopus 로고
    • The one-machine just-in-time scheduling problem with preemption
    • F. Hendel, N. Runge, and F. Sourd The one-machine just-in-time scheduling problem with preemption Discrete Optimization 6 2009 10 22
    • (2009) Discrete Optimization , vol.6 , pp. 10-22
    • Hendel, F.1    Runge, N.2    Sourd, F.3
  • 9
    • 33646466321 scopus 로고    scopus 로고
    • Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem
    • Y. Hendel, and F. Sourd Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem European Journal of Operational Research 173 2006 108 119
    • (2006) European Journal of Operational Research , vol.173 , pp. 108-119
    • Hendel, Y.1    Sourd, F.2
  • 12
    • 0001399202 scopus 로고    scopus 로고
    • A branch-and-bound algorithm for single machine earliness-tardiness scheduling with idle time
    • J.A. Hoogeveen, and S.L. Van De Velde A branch-and-bound algorithm for single machine earliness-tardiness scheduling with idle time INFORMS Journal on Computing 8 1996 402 412
    • (1996) INFORMS Journal on Computing , vol.8 , pp. 402-412
    • Hoogeveen, J.A.1    Van De Velde, S.L.2
  • 14
    • 12944258951 scopus 로고    scopus 로고
    • Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey
    • DOI 10.1016/j.mcm.2003.05.019, PII S0895717704803285
    • V. Lauff, and F. Werner Scheduling with common due date, ear lines and tardiness penalties for multimachine problems: A survey Mathematical and Computer Modeling 40 2004 637 655 (Pubitemid 40172119)
    • (2004) Mathematical and Computer Modelling , vol.40 , Issue.5-6 , pp. 637-655
    • Lauff, V.1    Werner, F.2
  • 16
    • 34248179019 scopus 로고    scopus 로고
    • A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date
    • DOI 10.1016/j.cie.2007.01.004, PII S0360835207000150
    • C.-J. Liao, and C.-C. Cheng A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date Computers and Industrial Engineering 52 2007 404 413 (Pubitemid 46719704)
    • (2007) Computers and Industrial Engineering , vol.52 , Issue.4 , pp. 404-413
    • Liao, C.-J.1    Cheng, C.-C.2
  • 17
    • 0001017536 scopus 로고    scopus 로고
    • Genetic algorithms for the operations researcher
    • C.R. Reeves Genetic algorithms for the operations researcher INFORMS Journal on computing 9 1997 231 250 (Pubitemid 127695176)
    • (1997) INFORMS Journal on Computing , vol.9 , Issue.3 , pp. 231-250
    • Reeves, C.R.1
  • 18
    • 27844533437 scopus 로고    scopus 로고
    • Genetic algorithms
    • C.R. Reeves Genetic algorithms F. Glover, G.A. Kochenberger, Handbook of metaheuristics 2003 Kluwer Academic Publishers Dordrecht 55 82
    • (2003) Handbook of Metaheuristics , pp. 55-82
    • Reeves, C.R.1
  • 19
    • 13544272574 scopus 로고    scopus 로고
    • Punctuality and idleness in just-in-time scheduling
    • DOI 10.1016/j.ejor.2004.07.018, PII S0377221704004758, Multicriteria Scheduling
    • F. Sourd Punctuality and idleness in just-in-time scheduling European Journal of Operational Research 167 2005 739 751 (Pubitemid 40220088)
    • (2005) European Journal of Operational Research , vol.167 , Issue.3 , pp. 739-751
    • Sourd, F.1
  • 20
    • 3543096874 scopus 로고    scopus 로고
    • The one machine problem with earliness and tardiness penalties
    • F. Sourd, and S. Kedad-Sidhoum The one machine problem with earliness and tardiness penalties Journal of Scheduling 6 2003 533 549
    • (2003) Journal of Scheduling , vol.6 , pp. 533-549
    • Sourd, F.1    Kedad-Sidhoum, S.2
  • 21
    • 38349141886 scopus 로고    scopus 로고
    • A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
    • F. Sourd, and S. Kedad-Sidhoum A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem Journal of Scheduling 11 2008 49 58
    • (2008) Journal of Scheduling , vol.11 , pp. 49-58
    • Sourd, F.1    Kedad-Sidhoum, S.2


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