메뉴 건너뛰기
Information Technology Journal
Volumn 9, Issue 6, 2010, Pages 1202-1206
Integration of job scheduling with delivery vehicles routing
Author keywords

Integer programming; Makespan; Scheduling; Single machine; Supply chain management; Vehicle
Indexed keywords

INTEGER PROGRAMMING; JOB SHOP SCHEDULING; MACHINERY; OPTIMIZATION; SCHEDULING ALGORITHMS; SUPPLY CHAIN MANAGEMENT; VEHICLE ROUTING; VEHICLES;
EID: 77954502658     PISSN: 18125638     EISSN: 18125646     Source Type: Journal    
DOI: 10.3923/itj.2010.1202.1206     Document Type: Article
Times cited : (3)
References (15)
  • 1
    • 2642510666 scopus 로고    scopus 로고
    • Machine scheduling with job delivery coordination
    • Chang, Y.C. and C.Y. Lee, 2004. Machine scheduling with job delivery coordination. Eur. J. Operat. Res., 158: 470-487.
    • (2004) Eur. J. Operat. Res. , vol.158 , pp. 470-487
    • Chang, Y.C.1    Lee, C.Y.2
  • 2
    • 22544461035 scopus 로고    scopus 로고
    • Integrated scheduling of production and distribution operations
    • Chen, Z.L. and G.L. Vairaktarakis, 2005. Integrated scheduling of production and distribution operations. Manage. Sci., 51: 614-628.
    • (2005) Manage. Sci. , vol.51 , pp. 614-628
    • Chen, Z.L.1    Vairaktarakis, G.L.2
  • 3
    • 0347649432 scopus 로고    scopus 로고
    • Minimizing makespan on parallel machines subject to release dates and delivery times
    • Gharbi, A. and M. Haouari, 2002. Minimizing makespan on parallel machines subject to release dates and delivery times. J. Sched., 5: 329-355.
    • (2002) J. Sched. , vol.5 , pp. 329-355
    • Gharbi, A.1    Haouari, M.2
  • 4
    • 74849101820 scopus 로고
    • Optimization and approximation in deterministic sequencing and scheduling theory: A survey
    • Graham, R.L., E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, 1979. Optimization and approximation in deterministic sequencing and scheduling theory: A survey. Ann. Discrete Math., 5: 287-326.
    • (1979) Ann. Discrete Math. , vol.5 , pp. 287-326
    • Graham, R.L.1    Lawler, E.L.2    J.Lenstra, K.3    Rinnooy Kan, A.H.G.4
  • 5
    • 0003162664 scopus 로고
    • Jackson's rule for single-machine scheduling: Making a good heuristic better
    • Hall, L.A. and B. Shmoys, 1992. Jackson's rule for single-machine scheduling: Making a good heuristic better. Math. Operat. Res., 17: 22-35.
    • (1992) Math. Operat. Res. , vol.17 , pp. 22-35
    • Hall, L.A.1    Shmoys, B.2
  • 6
    • 2342539189 scopus 로고    scopus 로고
    • Supply chain scheduling: Batching and delivery
    • Hall, N.G. and C.N. Potts, 2003. Supply chain scheduling: Batching and delivery. Oper. Res., 51: 566-584.
    • (2003) Oper. Res. , vol.51 , pp. 566-584
    • Hall, N.G.1    Potts, C.N.2
  • 7
    • 0344427189 scopus 로고    scopus 로고
    • Machine scheduling with transportation considerations
    • Lee, C.Y. and Z.L. Chen, 2001. Machine scheduling with transportation considerations. J. Schedul., 4: 3-24.
    • (2001) J. Schedul. , vol.4 , pp. 3-24
    • Lee, C.Y.1    Chen, Z.L.2
  • 8
    • 33750203805 scopus 로고    scopus 로고
    • Vehicle routing scheduling for cross-docking in the supply chain
    • Lee, Y.H., J.W. Jung andK.M. Lee, 2006. Vehicle routing scheduling for cross-docking in the supply chain. Comput. Ind. Eng., 51: 247-256.
    • (2006) Comput. Ind. Eng. , vol.51 , pp. 247-256
    • Lee, Y.H.1    Jung, J.W.2    Lee, K.M.3
  • 9
    • 10444261222 scopus 로고    scopus 로고
    • Machine scheduling with deliveries to multiple customer locations
    • Li, C.L., G. Vairaktarakis and C.Y. Lee, 2005. Machine scheduling with deliveries to multiple customer locations. Eur. J. Operat. Res., 164: 39-51.
    • (2005) Eur. J. Operat. Res. , vol.164 , pp. 39-51
    • Li, C.L.1    Vairaktarakis, G.2    Lee, C.Y.3
  • 10
    • 0037197530 scopus 로고    scopus 로고
    • Scheduling with job release dates delivery times and preemption penalties
    • Liu, Z. and T.C.E. Cheng, 2002. Scheduling with job release dates, delivery times and preemption penalties. Inform. Process. Lett, 82: 107-111.
    • (2002) Inform. Process. Lett , vol.82 , pp. 107-111
    • Liu, Z.1    Cheng, T.C.E.2
  • 11
    • 0001662666 scopus 로고
    • Analysis of a heuristic for one machine sequencing with release dates and delivery times
    • Potts, C.N., 1980. Analysis of a heuristic for one machine sequencing with release dates and delivery times. Operat. Res., 28: 1436-1441.
    • (1980) Operat. Res. , vol.28 , pp. 1436-1441
    • Potts, C.N.1
  • 12
    • 10444237299 scopus 로고    scopus 로고
    • Supply chain management and advanced planning-basics, overview and challenges
    • Stadtler, H., 2005. Supply chain management and advanced planning-basics, overview and challenges. Eur. J. Oper. Res., 163: 575-588.
    • (2005) Eur. J. Oper. Res. , vol.163 , pp. 575-588
    • Stadtler, H.1
  • 13
    • 21844520793 scopus 로고
    • Heuristics for parallel machine scheduling with delivery times
    • Woeginger, G.J., 1994. Heuristics for parallel machine scheduling with delivery times. Acta Inform., 31: 503-512.
    • (1994) Acta Inform. , vol.31 , pp. 503-512
    • Woeginger, G.J.1
  • 14
    • 3142635323 scopus 로고    scopus 로고
    • A polynomial-time approximation scheme for single-machine sequencing with delivery times and sequence-independent batch set-up times
    • Woeginger, G.J., 1998. A polynomial-time approximation scheme for single-machine sequencing with delivery times and sequence-independent batch set-up times. J. Sched., 1: 79-87.
    • (1998) J. Sched. , vol.1 , pp. 79-87
    • Woeginger, G.J.1
  • 15
    • 0029183195 scopus 로고
    • Analysis of approximation algorithms for single-machine scheduling with delivery times and sequence independent batch setup times
    • Zdrzalka, S., 1995. Analysis of approximation algorithms for single-machine scheduling with delivery times and sequence independent batch setup times. Eur. J. Oper. Res., 80: 371-380
    • (1995) Eur. J. Oper. Res. , vol.80 , pp. 371-380
    • Zdrzalka, S.1

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