Batch scheduling in a two-level supply chain - a focus on the supplier

被引:31
作者
Selvarajah, Esaignani [1 ]
Steiner, George [1 ]
机构
[1] McMaster Univ, Management Sci & Informat Syst Area, DeGroote Sch Business, Hamilton, ON L8S 4M4, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
scheduling; batching; combinatorial optimization; supply chain;
D O I
10.1016/j.ejor.2004.12.007
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper studies the batch scheduling problem in a supply chain from the supplier's point of view. The supplier has to manufacture multiple products in large quantities and deliver them to customers in batches. There is an associated delivery cost with each delivered batch. The objective of the supplier is to minimize the inventory holding and delivery costs. The supplier's system is modeled as a one-stage system in which processing a batch requires a setup when the system switches to a different product. A polynomial-time algorithm is presented to minimize the sum of the total inventory holding cost and the batch delivery cost of the supplier. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:226 / 240
页数:15
相关论文
共 23 条
  • [1] THE COMPLEXITY OF ONE-MACHINE BATCHING PROBLEMS
    ALBERS, S
    BRUCKER, P
    [J]. DISCRETE APPLIED MATHEMATICS, 1993, 47 (02) : 87 - 107
  • [3] CHEN ZL, 2000, SUPPKLY CHAIN SCHEDU
  • [4] Single machine scheduling with batch deliveries
    Cheng, TCE
    Gordon, VS
    Kovalyov, MY
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 94 (02) : 277 - 283
  • [5] Coffman E. G. Jr., 1990, Annals of Operations Research, V26, P135, DOI 10.1007/BF02248589
  • [6] BATCHING TO MINIMIZE FLOW TIMES ON ONE MACHINE
    DOBSON, G
    KARMARKAR, US
    RUMMEL, JL
    [J]. MANAGEMENT SCIENCE, 1987, 33 (06) : 784 - 799
  • [7] Supply chain scheduling: Batching and delivery
    Hall, NG
    Potts, CN
    [J]. OPERATIONS RESEARCH, 2003, 51 (04) : 566 - 584
  • [8] Scheduling with fixed delivery dates
    Hall, NG
    Lesaoana, M
    Potts, CN
    [J]. OPERATIONS RESEARCH, 2001, 49 (01) : 134 - 144
  • [9] STRONGLY POLYNOMIAL ALGORITHMS FOR THE HIGH MULTIPLICITY SCHEDULING PROBLEM
    HOCHBAUM, DS
    SHAMIR, R
    [J]. OPERATIONS RESEARCH, 1991, 39 (04) : 648 - 653
  • [10] Lee CY, 2001, J SCHED, V4, P3, DOI 10.1002/1099-1425(200101/02)4:1<3::AID-JOS57>3.0.CO