Plant co-ordination in pharmaceutics supply networks

被引:0
作者
Grunow, M [1 ]
Günther, HO [1 ]
Yang, G [1 ]
机构
[1] Tech Univ Berlin, Dept Prod Management, D-10585 Berlin, Germany
关键词
supply network planning; pharmaceutical industry; mixed-integer linear programming model; aggregation techniques; hierarchical production planning;
D O I
暂无
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
The production of active ingredients in the chemical-pharmaceutical industry involves numerous production stages with cumulative lead times of up to two years. Mainly because of rigorous purity requirements and the need of extensive cleaning of the equipment units, production is carried out in campaigns, i.e. multiple batches of the same product type are produced successively before changing to another product type. Each campaign requires a specific configuration of equipment units according to the recipes of the particular chemical process. In the chemicalpharmaceutical industry, production stages are often assigned to different locations, even different countries. Hence the co-ordination of plant operations within the resulting multi-national supply network is of major importance. A key issue is the co-ordination of campaign schedules at different production stages in the various plants. In practice, it is almost impossible to determine exact optimal solutions to the corresponding complex supply network problem with respect to overall logistics costs. In order to reduce the required computational effort, we introduce several aggregation schemes and a novel MILP model formulation which is based on a continuous representation of time. Moreover, we propose an iterative near-optimal solution procedure which can be successfully applied to even exceptionally large real life problem instances. The applicability of the approach suggested is shown using a case study from industry.
引用
收藏
页码:109 / 141
页数:33
相关论文
共 45 条
  • [1] Perspectives on model based integration of process operations
    Bassett, MH
    Dave, P
    Doyle, FJ
    Kudva, GK
    Pekny, JF
    Reklaitis, GV
    Subrahmanyam, S
    Miller, DL
    Zentner, MG
    [J]. COMPUTERS & CHEMICAL ENGINEERING, 1996, 20 (6-7) : 821 - 844
  • [2] Decomposition techniques for the solution of large-scale scheduling problems
    Bassett, MH
    Pekny, JF
    Reklaitis, GV
    [J]. AICHE JOURNAL, 1996, 42 (12) : 3373 - 3387
  • [3] An integrated system solution for supply chain optimization in the chemical process industry
    Berning G.
    Brandenburg M.
    Gürsoy K.
    Mehta V.
    Tölle F.-J.
    [J]. OR Spectrum, 2002, 24 (4) : 371 - 401
  • [4] Scheduling of a multi-product batch process in the chemical industry
    Blomer, F
    Gunther, HO
    [J]. COMPUTERS IN INDUSTRY, 1998, 36 (03) : 245 - 259
  • [5] LP-based heuristics for scheduling chemical batch processes
    Blömer, F
    Günther, HO
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2000, 38 (05) : 1029 - 1051
  • [6] BLOMER F, 1999, PRODUKTIONSPLANUNG S
  • [7] Dimitriadis AD, 1997, COMPUT CHEM ENG, V21, pS1061
  • [8] GROSSMANN JE, 1996, BATCH PROCESSING SYS, P451
  • [9] Campaign planning for multi-stage batch processes in the chemical industry
    Grunow M.
    Günther H.-O.
    Lehmann M.
    [J]. OR Spectrum, 2002, 24 (3) : 281 - 314
  • [10] A novel MILP formulation for short-term scheduling of multi-stage multi-product batch plants with sequence-dependent constraints
    Hui, CW
    Gupta, A
    van der Meulen, HAJ
    [J]. COMPUTERS & CHEMICAL ENGINEERING, 2000, 24 (12) : 2705 - 2717