2001年中国工程院组织了25位院士和40多位专家对我国制造业的现状、作用、地位及发展趋势和对策进行调查研究，撰写了“新世纪如何提高和发展我国制造业的研究报告”，该报告在以翔实的国情数据与世界各国进行比较分析的基础上，论述了制造业在我国国民经济和社会发展中的关键地位和作用。该报告指出：20世纪下半叶，我国自力更生、艰苦奋斗，启动了工业化进程，建立了较为完整的工业体系，培养了数代优秀的科学家和工程师，为经济发展、社会进步和国防建设做出了历史性的贡献，制造业体系的建立和已经取得的成就为我国21世纪的工业化、现代化建设打下了良好的基础。但是与发达国家相比，我国的制造能力和技术水平不高，创新能力不足，市场竞争力不强，经济建设和高技术产业所需的许多装备仍依赖进口。
经济社会的快速发展和科学技术的突飞猛进对制造业提出了更新、更高的要求，为制造业提供了广阔的发展空间。在加速科技进步和产业结构升级中，制造业作为经济社会发展和科技进步的原动力，其不可替代的基础性作用进一步显现。以信息技术为代表的新科技革命正在引领全球制造业发生深刻的变革，先进的制造技术正在向智能化、网络化、绿色化、服务化和全球化方向发展，制造业也随之迈入了崭新的发展阶段。我国应该抓住这一有利时机，采取一切可能的措施，建立强大的制造业。制造业的发展，需要科学的制造工程管理理论与方法的支撑。杨善林教授及其团队结合我国制造工程管理的实践，坚持研究制造工程管理中的优化理论与方法，不仅可以为制造型企业的优化管理决策提供科学的依据，对降低企业的资源消耗和制造成本以及提高企业的经营效益和客户满意度发挥积极作用，而且对于提升我国制造业的整体竞争力、建设制造强国，也具有至关重要的意义。
制造工程管理是一个十分复杂的系统工程。杨善林教授及其团队按照理论与实践相结合的思路，以我国多家大型联合企业为背景，从生产批量与定价联合优化、生产调度优化、机器调度优化、库存控制优化、物流路径优化、供应链协调与优化六个方面系统深入地开展了研究工作。在生产批量与定价联合优化方面，分别对允许供货延迟、库存能力受限、生产能力受限、考虑市场细分等情形下的定价与批量联合决策问题进行了深入的研究；在生产调度优化方面，重点研究了高耗能领域中如何在生产调度的过程中同时实现能耗的控制；在机器调度优化方面，主要研究了维护时段可调、加工时间可变的带预防性维护的机器调度优化问题；在库存控制优化方面，着重研究了连续性生产策略下制造企业的最优生产库存计划问题；在物流路径优化方面，针对企业内部物流配送，研究了带时间窗约束的物流路径优化问题及其主要衍生问题；在供应链协调与优化方面，针对制造商生产的弹性和销售商订购的灵活性，研究了多种生产和订购模式下供应链运作决策的协同匹配问题等。上述研究工作取得了非常有意义的理论成果和应用成效。
杨善林教授及其团队怀着对促进中国经济与社会发展的使命感和责任感，致力于发现生产实际问题，凝练其中的科学问题，进而通过研究实践，最后将其上升到理论高度，然后再应用于实践，接受实践的检验，并指导实践。杨善林教授及其团队所践行的这条学术研究的道路可以称得上是中国管理学界值得推崇的范例。因此，我愿意向读者推荐这本学术着作，并为之作序。
中国工程院院士
西安交通大学教授
2012年元旦
[1]
[1]
[1]
[1]
[1]
[1]
[1]
[1]
[1]
[2]
[2]
[2]
[2]
[2]
[2]
[2]
[2]
[2]
[3]
[3]
[3]
[3]
[3]
[3]
[3]
[3]
[3]
[4]
[4]
[4]
[4]
[4]
[4]
[4]
[4]
[4]
[5]
[5]
[5]
[5]
[5]
[5]
[5]
[5]
[5]
[6]
[6]
[6]
[6]
[6]
[6]
[6]
[6]
[6]
[7]
[7]
[7]
[7]
[7]
[7]
[7]
[7]
[7]
[8]
[8]
[8]
[8]
[8]
[8]
[8]
[8]
[8]
[9]
[9]
[9]
[9]
[9]
[9]
[9]
[9]
[9]
[10]
[10]
[10]
[10]
[10]
[10]
[10]
[10]
[10]
[11]
[11]
[11]
[11]
[11]
[11]
[11]
[11]
[11]
[12]
[12]
[12]
[12]
[12]
[12]
[12]
[12]
[12]
[13]
[13]
[13]
[13]
[13]
[13]
[13]
[13]
[13]
[14]
[14]
[14]
[14]
[14]
[14]
[14]
[14]
[14]
[15]
[15]
[15]
[15]
[15]
[15]
[15]
[15]
[15]
[16]
[16]
[16]
[16]
[16]
[16]
[16]
[16]
[16]
[17]
[17]
[17]
[17]
[17]
[17]
[17]
[17]
[17]
[18]
[18]
[18]
[18]
[18]
[18]
[18]
[18]
[18]
[19]
[19]
[19]
[19]
[19]
[19]
[19]
[19]
[19]
[20]
[20]
[20]
[20]
[20]
[20]
[20]
[20]
[20]
[21]
[21]
[21]
[21]
[21]
[21]
[21]
[21]
[21]
[22]
[22]
[22]
[22]
[22]
[22]
[22]
[22]
[22]
[23]
[23]
[23]
[23]
[23]
[23]
[23]
[23]
[23]
[24]
[24]
[24]
[24]
[24]
[24]
[24]
[24]
[24]
[25]
[25]
[25]
[25]
[25]
[25]
[25]
[25]
[25]
[26]
[26]
[26]
[26]
[26]
[26]
[26]
[26]
[26]
[27]
[27]
[27]
[27]
[27]
[27]
[27]
[27]
[27]
[28]
[28]
[28]
[28]
[28]
[28]
[28]
[28]
[28]
[29]
[29]
[29]
[29]
[29]
[29]
[29]
[29]
[29]
[30]
[30]
[30]
[30]
[30]
[30]
[30]
[30]
[30]
[31]
[31]
[31]
[31]
[31]
[31]
[31]
[31]
[31]
[32]
[32]
[32]
[32]
[32]
[32]
[32]
[32]
[32]
[33]
[33]
[33]
[33]
[33]
[33]
[33]
[33]
[33]
[34]
[34]
[34]
[34]
[34]
[34]
[34]
[34]
[34]
[35]
[35]
[35]
[35]
[35]
[35]
[35]
[35]
[35]
[36]
[36]
[36]
[36]
[36]
[36]
[36]
[36]
[37]
[37]
[37]
[37]
[37]
[37]
[37]
[37]
[38]
[38]
[38]
[38]
[38]
[38]
[38]
[38]
[39]
[39]
[39]
[39]
[39]
[39]
[39]
[39]
[40]
[40]
[40]
[40]
[40]
[40]
[40]
[40]
[41]
[41]
[41]
[41]
[41]
[41]
[41] ，?elik C. Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardi ness[J]. Applied Mathematical Modelling，2011，35：4117～4126.
" class="fullContentFlag"/>
[41]
[42]
[42]
[42]
[42]
[42]
[42]
[42]
[42]
[43]
[43]
[43]
[43]
[43]
[43]
[43]
[43]
[44]
[44]
[44]
[44]
[44]
[44]
[44]
[44]
[45]
[45]
[45]
[45]
[45]
[45]
[45]
[45]
[46]
[46]
[46]
[46]
[46]
[46]
[46]
[46]
[47]
[47]
[47]
[47]
[47]
[47]
[47]
[47]
[48]
[48]
[48]
[48]
[48]
[48]
[48]
[48]
[49]
[49]
[49]
[49]
[49]
[49]
[49]
[49]
[50]
[50]
[50]
" class="fullContentFlag"/>
[50]
[50]
[50]
[50]
[50]
[51]
[51]
[51]
[51]
[51]
[51]
[51]
[51]
[52]
[52]
[52]
[52]
[52]
[52]
[52]
[52]
[53]
[53]
[53]
[53]
[53]
[53]
[53]
[53]
[54]
[54]
[54]
[54]
[54]
[54]
[54]
[54]
[55]
[55]
[55]
[55]
[55]
[55]
[55]
[55]
[56]
[56]
[56]
[56]
[56]
[56]
[56]
[56]
[57]
[57]
[57]
[57]
[57]
[57]
[57]
[57]
[58]
[58]
[58]
[58]
[58]
[58]
[58]
[58]
[59]
[59]
[59]
[59]
[59]
[59]
[59]
[59]
[60]
[60]
[60]
[60]
[60]
[60]
[60]
[60]
[61]
[61]
[61]
[61]
[61]
[61]
[61]
[61]
[62]
[62]
[62]
[62]
[62]
[62]
[62]
[62]
[63]
[63]
[63]
[63]
[63]
" class="fullContentFlag"/>
[63]
[63]
[63]
[64]
[64]
[64]
[64]
[64]
[64]
[64]
[64]
[65]
[65]
[65]
[65]
[65]
[65]
[65]
[65]
[66]
[66]
[66]
[66]
[66]
[66]
[66]
[66]
[67]
[67]
[67]
[67]
[67]
[67]
[67]
[67]
[68]
[68]
[68]
[68]
[68]
[68]
[68]
[68]
[69]
[69]
[69]
[69]
[69]
[69]
[69]
[69]
[70]
[70]
[70]
[70]
[70]
[70]
[70]
[70]
[71]
[71]
[71]
[71]
[71]
[71]
[71]
[71]
[72]
[72]
[72]
[72]
[72]
[72]
[72]
[72]
[73]
[73]
[73]
[73]
[73]
[73]
[73]
[73]
[74]
[74]
[74]
[74]
[74]
[74]
[74]
[74]
[75]
[75]
[75]
[75]
[75]
[75]
[75]
[75]
[76]
[76]
[76]
[76]
[76]
[76]
[76]
[76]
[77]
[77]
[77]
[77]
[77]
[77]
[77]
[77]
[78]
[78]
[78]
[78]
[78]
[78]
[78]
[78]
[79]
[79]
[79]
[79]
[79]
[79]
[79]
[79]
[80]
[80]
[80]
[80]
[80]
[80]
[80]
[80]
[81]
[81]
[81]
[81]
[81]
[81]
[81]
[81]
[82]
[82]
[82]
[82]
[82]
[82]
[82]
[82]
[83]
[83]
[83]
[83]
[83]
[83]
[83]
[83]
[84]
[84]
[84]
[84]
[84]
[84]
[84]
[84]
[85]
[85]
[85]
[85]
[85]
[85]
[85]
" class="fullContentFlag"/>
[85]
[86]
[86]
[86]
[86]
[86]
[86]
[86]
[86]
[87]
[87]
[87]
[87]
[87]
[87]
[87]
[88]
[88]
[88]
[88]
[88]
[88]
[88]
[89]
[89]
[89]
[89]
[89]
[89]
[89]
[90]
[90]
[90]
[90]
[90]
[90]
[90]
[91]
[91]
[91]
[91]
[91]
[91]
[91]
[92]
[92]
[92]
[92]
[92]
[92]
[92]
[93]
[93]
[93]
[93]
[93]
[93]
[93]
[94]
[94]
[94]
[94]
[94]
[94]
[94]
[95]
[95]
[95]
[95]
[95]
[95]
[95]
[96]
[96]
[96]
[96]
[96]
[96]
[96]
[97]
[97]
[97]
[97]
[97]
[97]
[97]
[98]
[98]
[98]
[98]
[98]
[98]
[98]
[99]
[99]
[99]
[99]
[99]
[99]
[99]
[100]
[100]
[100]
[100]
[100]
[100]
[100]
[101]
[101]
[101]
[101]
[101]
[101]
[101]
[102]
[102]
[102]
[102]
[102]
[102]
[102]
[103]
[103]
[103]
[103]
[103]
[103]
[103]
[104]
[104]
[104]
[104]
[104]
[104]
[104]
[105]
[105]
[105]
[105]
[105]
[105]
[105]
[106]
[106]
[106]
[106]
[106]
[106]
[106]
[107]
[107]
[107]
[107]
[107]
[107]
[107]
[108]
[108]
[108]
[108]
[108]
[108]
[108]
[109]
[109]
[109]
[109]
[109]
[109]
[109]
[110]
[110]
[110]
[110]
[110]
[110] ，Drozdowski M，Formanowicz P，et al. Scheduling preemptable tasks on parallel processors with limited availability[J]. Parallel Computing，2000，26：1195～1211.
" class="fullContentFlag"/>
[111]
[111]
[111]
[111]
[111]
[111]
[112]
[112]
[112]
[112]
[112]
[112]
[113]
[113]
[113]
[113]
[113]
[113]
[114]
[114]
[114]
[114]
[114]
[114]
[115]
[115]
[115]
[115]
[115]
[115]
" class="fullContentFlag"/>
[116]
[116]
[116]
[116]
[116]
[116]
[117]
[117]
[117]
[117]
[117]
[117]
[118]
[118]
[118]
[118]
[118]
[119]
[119]
[119]
[119]
[120]
[120]
[120]
[120]
[121]
[121]
[121]
[121]
[122]
[122]
[122]
[122]
[123]
[123]
[123]
[123]
[124]
[124]
[124]
[125]
[125]
[126]
[126]
[127]
[127]
[128]
[128]
[129]
[129]
[130]
[130]
[131]
[131]
[132]
[132]
[133]
[133]
[134]
[134]
[135]
[135]
[136]
[136]
[137]
[137]
[138]
[138]
[139]
[139]
[140]
[140]
[141]
[141]
[142]
[142]
[143]
[143]
[144]
[144]
[145]
[145]
[146]
[146]
[147]
[147]
[148]
[149]
[150]
[151]
[152]
[153]
[154]
[155]
[156]
[157]
[158]
[159]
[160]
[161]
[162]
[163]
[164]
[165]
[166]
[167]
[168]
[169]
[170]
[171]
Citations
Altmetric
Copyright 2019 Science China Press Co., Ltd. 科学大众杂志社有限责任公司 版权所有
京ICP备18024590号-1
