메뉴 건너뛰기




Volumn 200, Issue 2, 2010, Pages 377-384

On-line integrated production-distribution scheduling problems with capacitated deliveries

Author keywords

Combinatorial optimization; Competitive analysis; Integrated production distribution problems; On line algorithm; Supply chain scheduling

Indexed keywords

COMPETITIVE ANALYSIS; DELIVERY COSTS; DISTRIBUTION PROBLEM; FLOW-TIME; INTEGRATED PRODUCTION; INTEGRATED PRODUCTION-DISTRIBUTION PROBLEMS; ON-LINE ALGORITHM; ON-LINE ALGORITHMS; SCHEDULING PROBLEM; SUPPLY CHAIN SCHEDULING; TOTAL COSTS; UPPER BOUND; WORST-CASE PERFORMANCE;

EID: 69249213639     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.12.030     Document Type: Article
Times cited : (48)

References (20)
  • 2
    • 33847288279 scopus 로고    scopus 로고
    • On-line supply chain scheduling problems with preemption
    • Averbakh I., and Xue Z. On-line supply chain scheduling problems with preemption. European Journal of Operational Research 181 (2007) 500-504
    • (2007) European Journal of Operational Research , vol.181 , pp. 500-504
    • Averbakh, I.1    Xue, Z.2
  • 4
    • 69249230003 scopus 로고    scopus 로고
    • Integrated production and outbound scheduling: Review and extensions
    • To appear in
    • Z.-L. Chen, Integrated production and outbound scheduling: Review and extensions, To appear in Operations Research. .
    • Operations Research
    • Chen, Z.-L.1
  • 5
    • 38549131389 scopus 로고    scopus 로고
    • Supply chain scheduling: Conflict and cooperation in assembly systems
    • Chen Z.-L., and Hall N. Supply chain scheduling: Conflict and cooperation in assembly systems. Operations Research 55 (2007) 1072-1089
    • (2007) Operations Research , vol.55 , pp. 1072-1089
    • Chen, Z.-L.1    Hall, N.2
  • 6
    • 33744826037 scopus 로고    scopus 로고
    • Order assignment and scheduling in a supply chain
    • Chen Z.-L., and Pundoor G. Order assignment and scheduling in a supply chain. Operations Research 54 (2006) 555-572
    • (2006) Operations Research , vol.54 , pp. 555-572
    • Chen, Z.-L.1    Pundoor, G.2
  • 7
    • 22544461035 scopus 로고    scopus 로고
    • Integrated scheduling of production and distribution operations
    • Chen Z.-L., and Vairaktarakis G.L. Integrated scheduling of production and distribution operations. Management Science 51 4 (2005) 614-628
    • (2005) Management Science , vol.51 , Issue.4 , pp. 614-628
    • Chen, Z.-L.1    Vairaktarakis, G.L.2
  • 8
    • 33947411193 scopus 로고    scopus 로고
    • On-line scheduling in a parallel batch processing system to minimize makespan using restarts
    • Fu R., Ji T., Yuan J., and Lin Y. On-line scheduling in a parallel batch processing system to minimize makespan using restarts. Theoretical Computer Science 374 (2007) 196-202
    • (2007) Theoretical Computer Science , vol.374 , pp. 196-202
    • Fu, R.1    Ji, T.2    Yuan, J.3    Lin, Y.4
  • 9
    • 2342539189 scopus 로고    scopus 로고
    • Supply chain scheduling: Batching and delivery
    • Hall N.G., and Potts C.N. Supply chain scheduling: Batching and delivery. Operations Research 51 4 (2003) 566-584
    • (2003) Operations Research , vol.51 , Issue.4 , pp. 566-584
    • Hall, N.G.1    Potts, C.N.2
  • 10
    • 24144473403 scopus 로고    scopus 로고
    • The coordination of scheduling and batch deliveries
    • Hall N.G., and Potts C.N. The coordination of scheduling and batch deliveries. Annals of Operations Research 135 (2005) 41-64
    • (2005) Annals of Operations Research , vol.135 , pp. 41-64
    • Hall, N.G.1    Potts, C.N.2
  • 11
    • 0003054009 scopus 로고    scopus 로고
    • A best possible on-line algorithm for minimizing maximum delivery time on a single machine
    • Hoogeveen J.A., and Vestjens A.P.A. A best possible on-line algorithm for minimizing maximum delivery time on a single machine. SIAM Journal on Discrete Mathematics 13 1 (2000) 56-63
    • (2000) SIAM Journal on Discrete Mathematics , vol.13 , Issue.1 , pp. 56-63
    • Hoogeveen, J.A.1    Vestjens, A.P.A.2
  • 12
    • 0344427189 scopus 로고    scopus 로고
    • Machine scheduling with transportation considerations
    • Lee C.-Y., and Chen Z.-L. Machine scheduling with transportation considerations. Journal of Scheduling 4 (2001) 3-24
    • (2001) Journal of Scheduling , vol.4 , pp. 3-24
    • Lee, C.-Y.1    Chen, Z.-L.2
  • 13
    • 24144484606 scopus 로고    scopus 로고
    • On-line scheduling algorithms for a batch machine with finite capacity
    • Poon C.K., and Yu W. On-line scheduling algorithms for a batch machine with finite capacity. Journal of Combinatorial Optimization 9 (2005) 167-186
    • (2005) Journal of Combinatorial Optimization , vol.9 , pp. 167-186
    • Poon, C.K.1    Yu, W.2
  • 16
    • 26444509814 scopus 로고    scopus 로고
    • Scheduling a production-distribution system to optimize the tradeoff between delivery tardiness and total distribution cost
    • Pundoor G., and Chen Z.-L. Scheduling a production-distribution system to optimize the tradeoff between delivery tardiness and total distribution cost. Naval Research Logistics 52 (2005) 571-589
    • (2005) Naval Research Logistics , vol.52 , pp. 571-589
    • Pundoor, G.1    Chen, Z.-L.2
  • 17
    • 0042545046 scopus 로고    scopus 로고
    • Randomized on-line scheduling with delivery times
    • Seiden S. Randomized on-line scheduling with delivery times. Journal of Combinatorial Optimization 3 (1999) 399-416
    • (1999) Journal of Combinatorial Optimization , vol.3 , pp. 399-416
    • Seiden, S.1
  • 18
    • 33947403964 scopus 로고    scopus 로고
    • On-line scheduling with delivery time on a single batch machine
    • Tian J., Fu R., and Yuan J. On-line scheduling with delivery time on a single batch machine. Theoretical Computer Science 374 (2007) 49-57
    • (2007) Theoretical Computer Science , vol.374 , pp. 49-57
    • Tian, J.1    Fu, R.2    Yuan, J.3
  • 19
    • 0041623258 scopus 로고    scopus 로고
    • Restarts can help in the on-line minimization of the maximum delivery time on a single machine
    • van den Akker M., Hoogeveen H., and Vakhania N. Restarts can help in the on-line minimization of the maximum delivery time on a single machine. Journal of Scheduling 3 (2000) 333-341
    • (2000) Journal of Scheduling , vol.3 , pp. 333-341
    • van den Akker, M.1    Hoogeveen, H.2    Vakhania, N.3
  • 20
    • 0035312326 scopus 로고    scopus 로고
    • On-line algorithms for minimizing makespan on batch processing machines
    • Zhang G., Cai X., and Wong C.K. On-line algorithms for minimizing makespan on batch processing machines. Naval Research Logistics 48 (2001) 241-258
    • (2001) Naval Research Logistics , vol.48 , pp. 241-258
    • Zhang, G.1    Cai, X.2    Wong, C.K.3


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