메뉴 건너뛰기




Volumn 47, Issue 2, 2000, Pages 145-165

Scheduling jobs and maintenance activities on parallel machines

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MACHINERY; MAINTENANCE; PLANNING; PROBLEM SOLVING;

EID: 0034159705     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6750(200003)47:2<145::AID-NAV5>3.0.CO;2-3     Document Type: Article
Times cited : (198)

References (27)
  • 1
    • 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 Inf 26 (1989), 679-696.
    • (1989) Acta Inf , vol.26 , pp. 679-696
    • Adiri, I.1    Bruno, J.2    Frostig, E.3    Rinnooy Kan, A.H.G.4
  • 2
    • 38149146772 scopus 로고
    • Scheduling identical parallel machine to minimize total weighted completion time
    • H. Belouadah and C.N. Potts, Scheduling identical parallel machine to minimize total weighted completion time, Discrete Appl Math 48 (1995), 201-218.
    • (1995) Discrete Appl Math , vol.48 , pp. 201-218
    • Belouadah, H.1    Potts, C.N.2
  • 3
    • 0027582974 scopus 로고
    • A dual ascent and column generation heuristic for the discrete lot sizing and scheduling problem with setup times
    • D. Cattrysse, M. Salomon, R. Kuik, and L.N. Van Wassenhove, A dual ascent and column generation heuristic for the discrete lot sizing and scheduling problem with setup times, Manage Sci 39 (1993), 477-486.
    • (1993) Manage Sci , vol.39 , pp. 477-486
    • Cattrysse, D.1    Salomon, M.2    Kuik, R.3    Van Wassenhove, L.N.4
  • 4
    • 0032154566 scopus 로고    scopus 로고
    • Machine scheduling, linear programming, and parameter list scheduling heuristic
    • L.M.A. Chan, P. Kaminsky, A. Muriel, and D. Simchi-Levi, Machine scheduling, linear programming, and parameter list scheduling heuristic, Oper Res 46 (1998), 729-741.
    • (1998) Oper Res , vol.46 , pp. 729-741
    • Chan, L.M.A.1    Kaminsky, P.2    Muriel, A.3    Simchi-Levi, D.4
  • 6
    • 0006715283 scopus 로고    scopus 로고
    • Solving parallel machine scheduling problems by column generation
    • Z.-L. Chen and W.B. Powell, Solving parallel machine scheduling problems by column generation, INFORMS J Comput 11 (1999), 78-94.
    • (1999) INFORMS J Comput , vol.11 , pp. 78-94
    • Chen, Z.-L.1    Powell, W.B.2
  • 7
    • 0032641373 scopus 로고    scopus 로고
    • A column generation based decomposition algorithm for a parallel machine scheduling just-in-time scheduling problem
    • Z.-L. Chen and W.B. Powell, A column generation based decomposition algorithm for a parallel machine scheduling just-in-time scheduling problem, Eur J Oper Res 116 (1999), 221-233.
    • (1999) Eur J Oper Res , vol.116 , pp. 221-233
    • Chen, Z.-L.1    Powell, W.B.2
  • 8
    • 85042163696 scopus 로고
    • A new optimization algorithm for the vehicle routing problem with time windows
    • M. Desrochers, J. Desrosiers, and M. Solomon, A new optimization algorithm for the vehicle routing problem with time windows, Oper Res 40 (1992), 342-254.
    • (1992) Oper Res , vol.40 , pp. 342-1254
    • Desrochers, M.1    Desrosiers, J.2    Solomon, M.3
  • 12
    • 0023994772 scopus 로고
    • A new approach for crew pairing problems by column generation with an application to air transport
    • S. Lavoie, M. Minoux, and E. Odier, A new approach for crew pairing problems by column generation with an application to air transport, Eur J Oper Res 35 (1988), 45-58.
    • (1988) Eur J Oper Res , vol.35 , pp. 45-58
    • Lavoie, S.1    Minoux, M.2    Odier, E.3
  • 13
    • 0001880962 scopus 로고
    • Parallel machines scheduling with non-simultaneous machine available time
    • C.-Y. Lee, Parallel machines scheduling with non-simultaneous machine available time, Discrete Appl Math 30 (1991), 53-61.
    • (1991) Discrete Appl Math , vol.30 , pp. 53-61
    • Lee, C.-Y.1
  • 14
    • 0000541519 scopus 로고    scopus 로고
    • Machine scheduling with an availability constraint
    • C.-Y. Lee, Machine scheduling with an availability constraint, J Global Optim 9 (1996), 395-416.
    • (1996) J Global Optim , vol.9 , pp. 395-416
    • Lee, C.-Y.1
  • 15
    • 0000049036 scopus 로고    scopus 로고
    • Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
    • C.-Y. Lee, Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint, Oper Res Lett 20 (1997), 129-139.
    • (1997) Oper Res Lett , vol.20 , pp. 129-139
    • Lee, C.-Y.1
  • 16
    • 0343422187 scopus 로고    scopus 로고
    • Machine scheduling with rate-modifying activity
    • to appear
    • C.-Y. Lee and J. Leon, Machine scheduling with rate-modifying activity," Eur J Oper Res (1998), to appear.
    • (1998) Eur J Oper Res
    • Lee, C.-Y.1    Leon, J.2
  • 17
    • 0026897390 scopus 로고
    • Single machine flow-time scheduling with scheduled maintenance
    • C.-Y. Lee and S.D. Liman, Single machine flow-time scheduling with scheduled maintenance, Acta Inf 29 (1992), 375-382.
    • (1992) Acta Inf , vol.29 , pp. 375-382
    • Lee, C.-Y.1    Liman, S.D.2
  • 18
    • 38249005916 scopus 로고
    • Capacitated two-parallel machines scheduling to minimize sum of job completion times
    • C.-Y. Lee and S.D. Liman, Capacitated two-parallel machines scheduling to minimize sum of job completion times, Discrete Appl Math 41 (1993), 211-222.
    • (1993) Discrete Appl Math , vol.41 , pp. 211-222
    • Lee, C.-Y.1    Liman, S.D.2
  • 20
    • 0002574777 scopus 로고
    • Minimizing the sum of job completion times on capacitated parallel machines
    • G. Mosheiov, Minimizing the sum of job completion times on capacitated parallel machines, Math Comput Model 20 (1994), 91-99.
    • (1994) Math Comput Model , vol.20 , pp. 91-99
    • Mosheiov, G.1
  • 22
    • 0001491109 scopus 로고
    • Scheduling independent tasks on parallel processors
    • M.H. Rothkopf, Scheduling independent tasks on parallel processors, Manage Sci 12 (1966), 437-447.
    • (1966) Manage Sci , vol.12 , pp. 437-447
    • Rothkopf, M.H.1
  • 23
    • 0003233928 scopus 로고    scopus 로고
    • Working Paper, Department of Computer and System Sciences, Nankai University, Tianjin, People's Republic of China
    • X. Qi, T. Chen, and F. Tu, Scheduling with the maintenance on a single machine, Working Paper, Department of Computer and System Sciences, Nankai University, Tianjin, People's Republic of China, 1997.
    • (1997) Scheduling with the Maintenance on a Single Machine
    • Qi, X.1    Chen, T.2    Tu, F.3
  • 24
    • 0021506728 scopus 로고
    • Scheduling on semi-identical processors
    • G. Schmidt, Scheduling on semi-identical processors, ZOR Z Oper Res 28 (1984), 153-162.
    • (1984) ZOR Z Oper Res , vol.28 , pp. 153-162
    • Schmidt, G.1
  • 25
    • 0023978728 scopus 로고
    • Scheduling independent tasks with deadlines on semi-identical processors
    • G. Schmidt, Scheduling independent tasks with deadlines on semi-identical processors, J Oper Res Soc 39 (1988), 271-277.
    • (1988) J Oper Res Soc , vol.39 , pp. 271-277
    • Schmidt, G.1
  • 27
    • 0028433926 scopus 로고
    • Solving binary cutting stock problems by column generation and branch-and-bound
    • P.H. Vance, C. Barnhart, E.J. Johnson, and G.L. Nemhauser, Solving binary cutting stock problems by column generation and branch-and-bound, Comput Optim Appl 3 (1994), 111-130.
    • (1994) Comput Optim Appl , vol.3 , pp. 111-130
    • Vance, P.H.1    Barnhart, C.2    Johnson, E.J.3    Nemhauser, G.L.4


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