메뉴 건너뛰기




Volumn 103, Issue 3, 2007, Pages 119-129

Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines

Author keywords

Analysis of algorithms; Flexible machines; Heuristics; Order scheduling; Uniform machines

Indexed keywords

HEURISTIC METHODS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; SWITCHING SYSTEMS;

EID: 34248187699     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.03.002     Document Type: Article
Times cited : (25)

References (11)
  • 1
    • 0030214445 scopus 로고    scopus 로고
    • The customer order lead-time problem on parallel machines
    • Blocher J., and Chhajed D. The customer order lead-time problem on parallel machines. Naval Research Logistics 43 (1996) 629-654
    • (1996) Naval Research Logistics , vol.43 , pp. 629-654
    • Blocher, J.1    Chhajed, D.2
  • 4
    • 34248158300 scopus 로고    scopus 로고
    • J.Y.-T. Leung, C.Y. Lee, C.W. Ng, G.H. Young, Minimizing total weighted completion time on flexible machines for order scheduling, submitted for publication
  • 5
    • 33646234775 scopus 로고    scopus 로고
    • Order scheduling models: An overview
    • Kendall G., Burke E.K., Petrovic S., and Gendreau M. (Eds), Springer
    • Leung J.Y.-T., Li H., and Pinedo M.L. Order scheduling models: An overview. In: Kendall G., Burke E.K., Petrovic S., and Gendreau M. (Eds). Multidisciplinary Scheduling: Theory and Applications (2005), Springer 37-53
    • (2005) Multidisciplinary Scheduling: Theory and Applications , pp. 37-53
    • Leung, J.Y.-T.1    Li, H.2    Pinedo, M.L.3
  • 6
    • 33646260457 scopus 로고    scopus 로고
    • Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
    • Leung J.Y.-T., Li H., and Pinedo M.L. Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel. Naval Research Logistics 53 (2006) 243-260
    • (2006) Naval Research Logistics , vol.53 , pp. 243-260
    • Leung, J.Y.-T.1    Li, H.2    Pinedo, M.L.3
  • 7
    • 0014596508 scopus 로고
    • Optimal preemptive scheduling on two-processor systems
    • Muntz R.R., and Coffman Jr. E.G. Optimal preemptive scheduling on two-processor systems. IEEE Transactions on Computers 11 (1969) 1014-1020
    • (1969) IEEE Transactions on Computers , vol.11 , pp. 1014-1020
    • Muntz, R.R.1    Coffman Jr., E.G.2
  • 9
    • 0002066821 scopus 로고
    • Various optimizers for single stage production
    • Smith W.E. Various optimizers for single stage production. Naval Research Logistics Quarterly 3 (1956) 59-66
    • (1956) Naval Research Logistics Quarterly , vol.3 , pp. 59-66
    • Smith, W.E.1
  • 10
    • 34248145046 scopus 로고    scopus 로고
    • J. Yang, Scheduling with batch objectives, PhD thesis, Industrial and Systems Engineering Graduate Program, The Ohio State University, Columbus, OH, 1998
  • 11
    • 17444403587 scopus 로고    scopus 로고
    • Scheduling parallel machines for the customer order problem
    • Yang J., and Posner M.E. Scheduling parallel machines for the customer order problem. Journal of Scheduling 8 (2005) 49-74
    • (2005) Journal of Scheduling , vol.8 , pp. 49-74
    • Yang, J.1    Posner, M.E.2


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