文章依据汉藏文资料,对藏文史书中记载的元朝大都梅朵热哇(me tog ra ba)今地做了考证,认为该地可能是位于今北京市西城区阜成门内大街路北妙应寺的故“大圣寿万安寺”。它既是帝师们撰写法旨、颁布命令、从事法事活动并最终圆寂之地,...文章依据汉藏文资料,对藏文史书中记载的元朝大都梅朵热哇(me tog ra ba)今地做了考证,认为该地可能是位于今北京市西城区阜成门内大街路北妙应寺的故“大圣寿万安寺”。它既是帝师们撰写法旨、颁布命令、从事法事活动并最终圆寂之地,也是担任帝师的萨迦派高僧活动的中心,还是总制院所在地。汉文中的“活佛”一词,最早出现在元世祖忽必烈至元年间,而非目前大家熟知的明正德年间。展开更多
There are many flow shop problems of throughput (denoted by FSPT) with constraints of due date in real production planning and scheduling. In this paper, a decomposition and coordination algorithm is proposed based on...There are many flow shop problems of throughput (denoted by FSPT) with constraints of due date in real production planning and scheduling. In this paper, a decomposition and coordination algorithm is proposed based on the analysis of FSPT and under the support of TOC (theory of constraint). A flow shop is at first decomposed into two subsystems named PULL and PUSH by means of bottleneck. Then the subsystem is decomposed into single machine scheduling problems,so the original NP-HARD problem can be transferred into a serial of single machine optimization problems finally. This method reduces the computational complexity, and has been used in a real project successfully.展开更多
文摘文章依据汉藏文资料,对藏文史书中记载的元朝大都梅朵热哇(me tog ra ba)今地做了考证,认为该地可能是位于今北京市西城区阜成门内大街路北妙应寺的故“大圣寿万安寺”。它既是帝师们撰写法旨、颁布命令、从事法事活动并最终圆寂之地,也是担任帝师的萨迦派高僧活动的中心,还是总制院所在地。汉文中的“活佛”一词,最早出现在元世祖忽必烈至元年间,而非目前大家熟知的明正德年间。
基金Supported by National Natural Science Foundation of P. R. China (60274013)
文摘There are many flow shop problems of throughput (denoted by FSPT) with constraints of due date in real production planning and scheduling. In this paper, a decomposition and coordination algorithm is proposed based on the analysis of FSPT and under the support of TOC (theory of constraint). A flow shop is at first decomposed into two subsystems named PULL and PUSH by means of bottleneck. Then the subsystem is decomposed into single machine scheduling problems,so the original NP-HARD problem can be transferred into a serial of single machine optimization problems finally. This method reduces the computational complexity, and has been used in a real project successfully.