http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
No-wait or no-idle permutation flowshopscheduling with dominating machines
Ji-Bo Wang,Zun-Quan Xia 한국전산응용수학회 2005 Journal of applied mathematics & informatics Vol.17 No.1-2
In this paper we study the no-wait or no-idle permutation flowshop scheduling problem with an increasing and decreasing series of dominating machines. The objective is to minimize one of the five regular performance criteria, namely, total weighted completion time, maximum lateness, maximum tardiness, number of tardy jobs and makespan. We establish that these five cases are solvable by presenting a polynomial-time solution algorithm for each case.
FLOW SHOP SCHEDULING JOBS WITH POSITION-DEPENDENT PROCESSING TIMES
WANG, JI-BO 한국전산응용수학회 2005 Journal of applied mathematics & informatics Vol.18 No.1
The paper is devoted to some flow shop scheduling problems, where job processing times are defined by functions dependent on their positions in the schedule. An example is constructed to show that the classical Johnson's rule is not the optimal solution for two different models of the two-machine flow shop scheduling to minimize makespan. In order to solve the makespan minimization problem in the two-machine flow shop scheduling, we suggest Johnson's rule as a heuristic algorithm, for which the worst-case bound is calculated. We find polynomial time solutions to some special cases of the considered problems for the following optimization criteria: the weighted sum of completion times and maximum lateness. Some furthermore extensions of the problems are also shown.
NO-WAIT OR NO-IDLE PERMUTATION FLOWSHOP SCHEDULING WITH DOMINATING MACHINES
WANG, JI BO,XIA, ZUN QUAN 한국전산응용수학회 2005 Journal of applied mathematics & informatics Vol.17 No.1
In this paper we study the no-wait or no-idle permutation flowshop scheduling problem with an increasing and decreasing series of dominating machines. The objective is to minimize one of the five regular performance criteria, namely, total weighted completion time, maximum lateness, maximum tardiness, number of tardy jobs and makespan. We establish that these five cases are solvable by presenting a polynomial-time solution algorithm for each case.
Flow shop scheduling jobs with position-dependent processing times
Ji-Bo Wang 한국전산응용수학회 2005 Journal of applied mathematics & informatics Vol.18 No.1-2
The paper is devoted to some flow shop scheduling problems, where job processing times are defined by functions dependent on their positions in the schedule. An example is constructed to show that the classical Johnson’s rule is not the optimal solution for two different models of the two-machine flow shop scheduling to minimize makespan. In order to solve the makespan minimization problem in the two-machine flow shop scheduling, we suggest Johnson’s rule as a heuristic algorithm, for which the worst-case bound is calculated. We find polynomial time solutions to some special cases of the considered problems for the following optimization criteria: the weighted sum of completion times and maximum lateness. Some furthermore extensions of the problems are also shown.
SINGLE MACHINE GROUP SCHEDULING UNDER DECREASING LINEAR DETERIORATION
Wang, Ji-Bo,Guo, Ai-Xia,Shan, Feng,Jiang, Bo,Wang, Li-Yan 한국전산응용수학회 2007 Journal of applied mathematics & informatics Vol.24 No.1
This paper considers single machine scheduling problems with group technology (GT) and deteriorating jobs. A sequence independent setup is required to process a job from a different group and jobs in each group are processed together. We consider the case of jobs whose processing times are a decreasing function of their starting time. The objectives of scheduling problems are to minimize the makespan and the total completion time, respectively. We also provide polynomial time algorithms to solve these problems.
Wang, Bo,Chun, Jaemoo,Liu, Yang,Han, Lina,Wang, Yan-shi,Joo, Eun-Ji,Kim, Yeong-Shik,Cheng, Mao-sheng The Royal Society of Chemistry 2012 Organic & Biomolecular Chemistry Vol.10 No.44
<P>We synthesized a diosgenyl saponin bearing a unique disaccharide from the natural product β-hederin, together with twelve glycosylated derivatives and determined their cytotoxicity against five different human cancer cell lines. Most of them showed weak cytotoxicity, with the exception of compound <B>20</B>, diosgenyl α-<SMALL>L</SMALL>-rhamnopyranosyl-(1→2)-[α-<SMALL>L</SMALL>-arabinopyranosyl-(1→4)]-α-<SMALL>L</SMALL>-arabinopyranoside, which exhibited strong cytotoxicity against A549 cells. The cytotoxicity of <B>20</B> was associated with apoptotic cell death, which was characterized by morphological changes, chromatin condensation, DNA fragmentation, and phosphatidylserine externalization. Compound <B>20</B> induced apoptosis of A549 cells through a caspase-8-mediated extrinsic pathway and a caspase-9-mediated intrinsic pathway. In addition, phosphorylation of JNK increased but the phosphorylation of ERK decreased after treatment with <B>20</B>. These results provide a basic mechanism for the anticancer activity of <B>20</B>.</P> <P>Graphic Abstract</P><P>The diosgenyl trisaccharide greatly induces apoptosis in A549 cells, mainly through an extrinsic pathway. <IMG SRC='http://pubs.rsc.org/services/images/RSCpubs.ePlatform.Service.FreeContent.ImageService.svc/ImageService/image/GA?id=c2ob26579f'> </P>
Ji, Tian-Xing,Zhi, Cheng,Guo, Xue-Guang,Zhou, Qiang,Wang, Guo-Qiang,Chen, Bo,Ma, Fei-Fei Asian Pacific Journal of Cancer Prevention 2015 Asian Pacific journal of cancer prevention Vol.16 No.14
Background: Previous studies investigating the association between miR-34b/c rs4938723 polymorphism and cancer risk showed inconclusive. Here, we performed meta-analysis to investigate the association between miR- 34b/c rs4938723 polymorphism and digestive cancer risk. Materials and Methods: Literature database including PubMed, OVID, Chinese National Knowledge Infrastructure (CNKI) were searched for publications concerning the association between the miR-34b/c rs4938723 polymorphism and digestive cancer risk. Results: A total of 6 studies consisting of 3246 cases and 3568 controls were included in this meta-analysis. The combined analysis suggested the miR-34b/c rs4938723 polymorphism significantly reduced digestive cancer risk under allelic model, homogeneous co-dominant model and recessive model (C vs T: OR=0.88, 95%CI=0.82-0.95, p-value=0.001; CC vs TT: OR =0.67, 95%CI=0.57-0.80, p-value=0.000; CC vs TT/TC: OR=0.68, 95%CI=0.58-0.80, p-value=0.000). Q-test and I2 test revealed no significant heterogeneity in all genotype comparisons. The Begger's funnel plot and Egger's test did not show significant publication bias. Conclusions: The current evidence supports the conclusion that the miR-34b/c rs4938723 polymorphism decreases an individual's susceptibility to digestive cancers.