메뉴 건너뛰기




Volumn 39, Issue 9, 2012, Pages 2196-2205

Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance

Author keywords

Heuristic; Periodic maintenance; Scheduling; Single machine; Tardy jobs

Indexed keywords

COMPUTATIONAL EXPERIMENT; HEURISTIC; INITIAL SOLUTION; NUMBER OF TARDY JOBS; PERIODIC MAINTENANCE; PROBLEM INSTANCES; SCHEDULING JOBS; SECOND PHASE; SINGLE MACHINE; SINGLE-MACHINE SCHEDULING; SOLUTION QUALITY; TARDY JOBS; TWO-PHASE HEURISTIC ALGORITHM;

EID: 84855549578     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.11.002     Document Type: Article
Times cited : (58)

References (35)
  • 4
    • 84974201117 scopus 로고
    • A note on stochastic scheduling on a single machine subject to breakdown-the preemptive repeat model
    • E. Frostig A note on stochastic scheduling on a single machine subject to breakdown-the preemptive repeat model Probability in the Engineering and Informational Sciences 5 1991 349 354
    • (1991) Probability in the Engineering and Informational Sciences , vol.5 , pp. 349-354
    • Frostig, E.1
  • 5
    • 0024944070 scopus 로고
    • Single machine flow-time scheduling with a single breakdown
    • I. Adiri, J. Bruno, E. Frostig, and A.H.G. Rinnooy Kan Single machine flow-time scheduling with a single breakdown Acta Informatica 26 1989 679 696 (Pubitemid 20631693)
    • (1989) Acta Informatica , vol.26 , Issue.7 , pp. 679-696
    • Adiri Igal1    Bruno John2    Frostig Esther3    Rinnooy Kan, A.H.G.4
  • 6
    • 84989688255 scopus 로고
    • Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs
    • I. Adiri, E. Frostig, and A.H.G. Rinnooy Kan Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs Naval Research Logistics 38 1991 261 271
    • (1991) Naval Research Logistics , vol.38 , pp. 261-271
    • Adiri, I.1    Frostig, E.2    Rinnooy Kan, A.H.G.3
  • 7
    • 0037316821 scopus 로고    scopus 로고
    • Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance
    • M.S. Akturk, J.B. Ghosh, and E.D. Gunes Scheduling with tool changes to minimize total completion time: a study of heuristics and their performance Naval Research Logistics 50 2003 15 30
    • (2003) Naval Research Logistics , vol.50 , pp. 15-30
    • Akturk, M.S.1    Ghosh, J.B.2    Gunes, E.D.3
  • 8
    • 2342558624 scopus 로고    scopus 로고
    • Scheduling with tool changes to minimize total completion time: Basic results and SPT performance
    • M.S. Akturk, J.B. Ghosh, and E.D. Gunes Scheduling with tool changes to minimize total completion time: basic results and SPT performance European Journal of Operations Research 157 2004 784 790
    • (2004) European Journal of Operations Research , vol.157 , pp. 784-790
    • Akturk, M.S.1    Ghosh, J.B.2    Gunes, E.D.3
  • 9
    • 12244256124 scopus 로고    scopus 로고
    • Scheduling tasks on a flexible manufacturing machine to minimize tool change delays
    • DOI 10.1016/j.ejor.2003.12.025, PII S0377221704001092
    • K.H. Ecker, and J.N.D. Gupta Scheduling tasks on a flexible manufacturing machine to minimize tool change delays European Journal of Operations Research 164 2005 627 638 (Pubitemid 40114586)
    • (2005) European Journal of Operational Research , vol.164 , Issue.3 , pp. 627-638
    • Ecker, K.H.1    Gupta, J.N.D.2
  • 10
    • 38649117967 scopus 로고    scopus 로고
    • Optimization models for the tool change scheduling problem
    • J.S. Chen Optimization models for the tool change scheduling problem Omega 36 2008 888 894
    • (2008) Omega , vol.36 , pp. 888-894
    • Chen, J.S.1
  • 11
    • 0035917221 scopus 로고    scopus 로고
    • Tool replacement policies for a machining centre producing multiple types of products with distinct due dates
    • DOI 10.1080/00207540010011054
    • Y.-C. Choi, and Y.-D. Kim Tool replacement policies for a machining center producing multiple types of products with distinct due dates International Journal of Production Research 39 2001 907 921 (Pubitemid 35165650)
    • (2001) International Journal of Production Research , vol.39 , Issue.5 , pp. 907-921
    • Choi, Y.-C.1    Kim, Y.-D.2
  • 12
    • 0037411886 scopus 로고    scopus 로고
    • Single-machine scheduling with periodic maintenance and nonresumable jobs
    • DOI 10.1016/S0305-0548(02)00074-6, PII S0305054802000746
    • C.J. Liao, and W.J. Chen Single-machine scheduling with periodic maintenance and nonresumable jobs Computers and Operations Research 30 2003 1335 1347 (Pubitemid 36463800)
    • (2003) Computers and Operations Research , vol.30 , Issue.9 , pp. 1335-1347
    • Liao, C.J.1    Chen, W.J.2
  • 13
    • 33645218963 scopus 로고    scopus 로고
    • Minimizing total flow time in the single-machine scheduling problem with periodic maintenance
    • W.J. Chen Minimizing total flow time in the single-machine scheduling problem with periodic maintenance Journal of the Operational Research Society 57 2006 410 415
    • (2006) Journal of the Operational Research Society , vol.57 , pp. 410-415
    • Chen, W.J.1
  • 14
    • 50349092766 scopus 로고    scopus 로고
    • Minimizing number of tardy jobs on a single machine subject to periodic maintenance
    • W.J. Chen Minimizing number of tardy jobs on a single machine subject to periodic maintenance Omega 37 2009 591 599
    • (2009) Omega , vol.37 , pp. 591-599
    • Chen, W.J.1
  • 16
    • 73449092465 scopus 로고    scopus 로고
    • A single-machine scheduling problem with maintenance activities to minimize makespan
    • C.J. Hsu, C. Low, and C.T. Su A single-machine scheduling problem with maintenance activities to minimize makespan Applied Mathematics and Computation 215 2010 3929 3935
    • (2010) Applied Mathematics and Computation , vol.215 , pp. 3929-3935
    • Hsu, C.J.1    Low, C.2    Su, C.T.3
  • 18
    • 0033446820 scopus 로고    scopus 로고
    • Scheduling the maintenance on a single machine
    • X. Qi, T. Chen, and F. Tu Scheduling the maintenance on a single machine Journal of the Operational Research Society 50 1999 1071 1078 (Pubitemid 129596359)
    • (1999) Journal of the Operational Research Society , vol.50 , Issue.10 , pp. 1071-1078
    • Qi, X.1    Chen, T.2    Tu, F.3
  • 19
    • 33745794508 scopus 로고    scopus 로고
    • Single-machine scheduling with flexible and periodic maintenance
    • DOI 10.1057/palgrave.jors.2602043, PII 2602043
    • J.S. Chen Single-machine scheduling with flexible and periodic maintenance Journal of the Operational Research Society 57 2006 703 710 (Pubitemid 44020394)
    • (2006) Journal of the Operational Research Society , vol.57 , Issue.6 , pp. 703-710
    • Chen, J.S.1
  • 20
    • 41149166270 scopus 로고    scopus 로고
    • Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
    • J.S. Chen Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan European Journal of Operational Research 190 2008 90 102
    • (2008) European Journal of Operational Research , vol.190 , pp. 90-102
    • Chen, J.S.1
  • 21
    • 55649110055 scopus 로고    scopus 로고
    • Single-machine scheduling with periodic and flexible periodic maintenance to minimize maximum tardiness
    • M. Sbihi, and C. Varnier Single-machine scheduling with periodic and flexible periodic maintenance to minimize maximum tardiness Computers and Industrial Engineering 55 2008 830 840
    • (2008) Computers and Industrial Engineering , vol.55 , pp. 830-840
    • Sbihi, M.1    Varnier, C.2
  • 22
    • 0000062028 scopus 로고
    • One machine sequencing algorithm for minimizing the number of late jobs
    • J.M. Moore One machine sequencing algorithm for minimizing the number of late jobs Management Science 15 1968 102 109
    • (1968) Management Science , vol.15 , pp. 102-109
    • Moore, J.M.1
  • 23
    • 0005025354 scopus 로고
    • A simple optimality proof of Moore's sequencing algorithm
    • L.B.J.M. Sturm A simple optimality proof of Moore's sequencing algorithm Management Science 17 1970 116 118
    • (1970) Management Science , vol.17 , pp. 116-118
    • Sturm, L.B.J.M.1
  • 26
    • 0017910613 scopus 로고
    • Solvable case of the one-machine scheduling problem with ready and due times
    • H. Kise, T. Ibaraki, and H. Mine A solvable case of the one-machine scheduling problem with ready and due times Operations Research 26 1978 121 126 (Pubitemid 8576425)
    • (1978) Operations Research , vol.26 , Issue.1 , pp. 121-126
    • Kise Hiroshi1    Ibaraki Toshihide2    Mine Hisashi3
  • 27
    • 0023223505 scopus 로고
    • Minimum number of tardy jobs in single machine scheduling with release dates - An improved algorithm
    • T.C. John, and Y.B. Wu Minimum number of tardy jobs in single machine scheduling with release dates - an improved algorithm Computers and Industrial Engineering 12 1987 223 230
    • (1987) Computers and Industrial Engineering , vol.12 , pp. 223-230
    • John, T.C.1    Wu, Y.B.2
  • 28
    • 0037209401 scopus 로고    scopus 로고
    • A branch and bound to minimize the number of late jobs on a single machine with release time constraints
    • P. Baptiste, L. Peridy, and E. Pinson A branch and bound to minimize the number of late jobs on a single machine with release time constraints European Journal of Operational Research 144 2003 1 11
    • (2003) European Journal of Operational Research , vol.144 , pp. 1-11
    • Baptiste, P.1    Peridy, L.2    Pinson, E.3
  • 29
    • 7544238004 scopus 로고    scopus 로고
    • An exact method to minimize the number of tardy jobs in single machine scheduling
    • S. Dauzère-Pérès, and M. Sevaux An exact method to minimize the number of tardy jobs in single machine scheduling Journal of Scheduling 7 2004 405 420
    • (2004) Journal of Scheduling , vol.7 , pp. 405-420
    • Dauzère-Pérès, S.1    Sevaux, M.2
  • 30
    • 38249020491 scopus 로고
    • Minimizing the number of tardy job units under release time constraints
    • D.S. Hochbaum, and R. Shamir Minimizing the number of tardy job units under release time constraints Discrete Applied Mathematics 28 1990 45 57
    • (1990) Discrete Applied Mathematics , vol.28 , pp. 45-57
    • Hochbaum, D.S.1    Shamir, R.2
  • 31
    • 0000889797 scopus 로고
    • A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
    • E.L. Lawler A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs Annals of Operations Research 26 1990 125 133
    • (1990) Annals of Operations Research , vol.26 , pp. 125-133
    • Lawler, E.L.1
  • 32
    • 0032627791 scopus 로고    scopus 로고
    • An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
    • P. Baptiste An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs Operations Research Letters 24 1999 175 180
    • (1999) Operations Research Letters , vol.24 , pp. 175-180
    • Baptiste, P.1
  • 33
    • 0028463787 scopus 로고
    • Scheduling jobs under simple linear deterioration
    • G. Mosheiov Scheduling jobs under simple linear deterioration Computers and Operations Research 21 1994 653 659
    • (1994) Computers and Operations Research , vol.21 , pp. 653-659
    • Mosheiov, G.1
  • 34
    • 78049409645 scopus 로고    scopus 로고
    • Minimizing the number of tardy jobs under piecewise-linear deterioration
    • G. Moslehi, and A. Jafari Minimizing the number of tardy jobs under piecewise-linear deterioration Computers and Industrial Engineering 59 2010 573 584
    • (2010) Computers and Industrial Engineering , vol.59 , pp. 573-584
    • Moslehi, G.1    Jafari, A.2
  • 35
    • 0000541519 scopus 로고    scopus 로고
    • Machine scheduling with an availability constraint
    • C.Y. Lee Machine scheduling with an availability constraint Journal of Global Optimization 9 1996 395 416
    • (1996) Journal of Global Optimization , vol.9 , pp. 395-416
    • Lee, C.Y.1


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