메뉴 건너뛰기
International Journal of Advanced Manufacturing Technology
Volumn 34, Issue 3-4, 2007, Pages 378-384
Single machine rescheduling with new jobs arrivals and processing time compression
Author keywords

Rescheduling new job disruption compression
Indexed keywords

COST REDUCTION; HEURISTIC ALGORITHMS; OPTIMIZATION; POLYNOMIALS; SCHEDULING;
EID: 36048929477     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-006-0590-7     Document Type: Article
Times cited : (45)
References (9)
  • 1
    • 0023825887 scopus 로고
    • A multiobjective, multi-level heuristic for dynamicresource constrained scheduling problems
    • Norbis MI, Smith JM (1988) A multi objective, multi-level heuristic for dynamic resource constrained scheduling problems. Eur J Oper Res33:30-41
    • (1988) Eur J Oper Res , vol.33 , pp. 30-41
    • Norbis, M.I.1    Smith, J.M.2
  • 2
    • 0000229534 scopus 로고
    • Match-up scheduling with multiple resources,release dates and disruptions
    • Bean JC, Birge JR,Mittenthal J, Noon CE (1991) Match-up scheduling with multiple resources,release dates and disruptions. Oper Res 39:470-483
    • (1991) OperRes , vol.39 , pp. 470-483
    • Bean, J.C.1    Birge, J.R.2    Mittenthal, J.3    Noon, C.E.4
  • 3
    • 0027224847 scopus 로고
    • One-machine rescheduling heuristics with efficiencyand stability as criteria
    • Wu SD, Storer RH, ChangPC (1993) One-machine rescheduling heuristics with efficiency and stability as criteria. Comp Oper Res 20:1-14
    • (1993) Comp Oper Res , vol.20 , pp. 1-14
    • Wu, S.D.1    Storer, R.H.2    Chang, P.C.3
  • 4
    • 0028499648 scopus 로고
    • Robustness measures and robustscheduling for job shops
    • Leon, VJ, Wu SD, StorerRH (1994) Robustness measures and robust scheduling for job shops. IIE Trans26:32-43
    • (1994) IIE Trans , vol.26 , pp. 32-43
    • Leon, V.J.1    Wu, S.D.2    Storer, R.H.3
  • 5
    • 0031525145 scopus 로고    scopus 로고
    • Rescheduling on a single machinewith part-type dependent setup times and deadlines
    • Unal AT, Uzsoy R, Kiran AS (1997) Rescheduling on a single machine with part-type dependent setup times and deadlines. Ann Oper Res 70:93-113
    • (1997) Ann Oper Res , vol.70 , pp. 93-113
    • Unal, A.T.1    Uzsoy, R.2    Kiran, A.S.3
  • 6
    • 19744366708 scopus 로고    scopus 로고
    • Rescheduling for new orders
    • Hall NG, Potts CN (2004) Rescheduling for new orders. Oper Res 52(3):440-453
    • (2004) Oper Res , vol.52 , Issue.3 , pp. 440-453
    • Hall, N.G.1    Potts, C.N.2
  • 7
    • 0019058538 scopus 로고
    • Choosing the job sequence and processing times to minimize total processing plus flow cost on a singlemachine
    • 5
    • Vickson RG (1980) Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine. Oper Res 28(5):1115-1167
    • (1980) Oper Res , vol.28 , pp. 1115-1167
    • Vickson, R.G.1
  • 8
    • 0000474126 scopus 로고
    • Minimizing total tardiness on one machine is NP_hard
    • Du J, Leung JY-T (1990) Minimizing total tardiness on one machine is NP-hard. Math Oper Res 15:483-495
    • (1990) Math Oper Res , vol.15 , pp. 483-495
    • Du, J.1    Jy-T, L.2
  • 9

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