메뉴 건너뛰기




Volumn 34, Issue 2, 2010, Pages 334-342

Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance

Author keywords

Flexible maintenance; Heuristic algorithm; NP hard; Periodic maintenance; Single machine scheduling

Indexed keywords

AVAILABILITY CONSTRAINTS; COMPUTATIONAL RESULTS; FIRST FIT; FLEXIBLE MAINTENANCE; FLEXIBLE MODEL; MAINTENANCE PERIODS; MAKESPAN; NP-HARD; PERIODIC MAINTENANCE; SINGLE MACHINE SCHEDULING; SINGLE MACHINE SCHEDULING PROBLEMS; TIME INTERVAL;

EID: 70349764553     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2009.04.014     Document Type: Article
Times cited : (118)

References (20)
  • 3
    • 84989688255 scopus 로고
    • Single machine flow-time scheduling with a single breakdown to minimize stochastically the number of tardy jobs
    • Adiri I., Frostig E., and Rinnooy Kan A.H.G. Single machine flow-time scheduling 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
  • 4
    • 0026897390 scopus 로고
    • Single machine flow-time scheduling with scheduled maintenance
    • Lee C.Y., and Liman S.D. Single machine flow-time scheduling with scheduled maintenance. Acta Informatica 29 (1992) 375-382
    • (1992) Acta Informatica , vol.29 , pp. 375-382
    • Lee, C.Y.1    Liman, S.D.2
  • 5
    • 0032362468 scopus 로고    scopus 로고
    • Machine scheduling with availability constraints
    • Sanlaville E., and Schmidt G. Machine scheduling with availability constraints. Acta Informatica 9 (1998) 795-811
    • (1998) Acta Informatica , vol.9 , pp. 795-811
    • Sanlaville, E.1    Schmidt, G.2
  • 7
    • 0037411886 scopus 로고    scopus 로고
    • Single-machine scheduling with periodic maintenance and nonresemable jobs
    • Liao C.J., and Chen W.J. Single-machine scheduling with periodic maintenance and nonresemable jobs. Computers and Operations Research 30 (2003) 1335-1347
    • (2003) Computers and Operations Research , vol.30 , pp. 1335-1347
    • Liao, C.J.1    Chen, W.J.2
  • 8
    • 33749681702 scopus 로고    scopus 로고
    • Single-machine scheduling with periodic maintenance to minimize makespan
    • Ji M., He Y., and Cheng T.C.E. Single-machine scheduling with periodic maintenance to minimize makespan. Computers and Operations Research 34 (2007) 1764-1770
    • (2007) Computers and Operations Research , vol.34 , pp. 1764-1770
    • Ji, M.1    He, Y.2    Cheng, T.C.E.3
  • 9
    • 0038517117 scopus 로고    scopus 로고
    • Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
    • Wu C.C., and Lee W.C. Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine. Information Processing Letters 87 (2003) 89-93
    • (2003) Information Processing Letters , vol.87 , pp. 89-93
    • Wu, C.C.1    Lee, W.C.2
  • 10
    • 33748547219 scopus 로고    scopus 로고
    • Scheduling linear deteriorating jobs with an availability constraint on a single machine
    • Ji M., He Y., and Cheng T.C.E. Scheduling linear deteriorating jobs with an availability constraint on a single machine. Theoretical Computer Science 362 (2006) 115-126
    • (2006) Theoretical Computer Science , vol.362 , pp. 115-126
    • Ji, M.1    He, Y.2    Cheng, T.C.E.3
  • 11
    • 5144229863 scopus 로고    scopus 로고
    • An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
    • Sadfi C., Penz B., Rapine C., Blazewicz J., and Formanowicz P. An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints. European Journal of Operational Research 161 (2005) 3-10
    • (2005) European Journal of Operational Research , vol.161 , pp. 3-10
    • Sadfi, C.1    Penz, B.2    Rapine, C.3    Blazewicz, J.4    Formanowicz, P.5
  • 12
    • 18744372153 scopus 로고    scopus 로고
    • Single machine scheduling with a restricted rate-modifying activity
    • Yong H., Ji M., and Cheng T.C.E. Single machine scheduling with a restricted rate-modifying activity. Naval Research Logistics 52 (2005) 361-369
    • (2005) Naval Research Logistics , vol.52 , pp. 361-369
    • Yong, H.1    Ji, M.2    Cheng, T.C.E.3
  • 13
    • 15244362679 scopus 로고    scopus 로고
    • Preemptive scheduling with availability constraints to minimize total weighted completion times
    • Wang G., Sun H., and Chu C. Preemptive scheduling with availability constraints to minimize total weighted completion times. Annals of Operations Research 133 (2005) 183-192
    • (2005) Annals of Operations Research , vol.133 , pp. 183-192
    • Wang, G.1    Sun, H.2    Chu, C.3
  • 14
    • 33645218963 scopus 로고    scopus 로고
    • Minimizing total flow time in the single-machine scheduling problem with periodic maintenance
    • Chen W.J. 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
  • 15
    • 33745794508 scopus 로고    scopus 로고
    • Single-machine scheduling with flexible and period maintenance
    • Chen J.S. Single-machine scheduling with flexible and period maintenance. Journal of the Operational Research Society 57 (2006) 703-710
    • (2006) Journal of the Operational Research Society , vol.57 , pp. 703-710
    • Chen, J.S.1
  • 16
    • 30344445140 scopus 로고    scopus 로고
    • Optimization models for the machine scheduling problem with a single flexible maintenance activity
    • Chen J.S. Optimization models for the machine scheduling problem with a single flexible maintenance activity. Engineering Optimization 38 (2006) 53-71
    • (2006) Engineering Optimization , vol.38 , pp. 53-71
    • Chen, J.S.1
  • 17
    • 41149166270 scopus 로고    scopus 로고
    • Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
    • Chen J.S. Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan. European Journal of Operations Research 190 (2008) 90-102
    • (2008) European Journal of Operations Research , vol.190 , pp. 90-102
    • Chen, J.S.1
  • 18
    • 34548655710 scopus 로고    scopus 로고
    • Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan
    • Xu D., Sun K., and Li H. Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan. Computers and Operations Research 35 (2008) 1344-1349
    • (2008) Computers and Operations Research , vol.35 , pp. 1344-1349
    • Xu, D.1    Sun, K.2    Li, H.3
  • 19
    • 60649111057 scopus 로고    scopus 로고
    • A note on scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
    • Xu D., Sun K., and Li H. A note on scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan. European Journal of Operations Research 197 (2009) 825-827
    • (2009) European Journal of Operations Research , vol.197 , pp. 825-827
    • Xu, D.1    Sun, K.2    Li, H.3


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