26 research outputs found
A probabilistic tree-based representation for non-convex minimum cost flow problems
Network flow optimisation has many real-world applications. The minimum cost flow problem (MCFP) is one of the most common network flow problems. Mathematical programming methods often assume the linearity and convexity of the underlying cost function, which is not realistic in many real-world situations. Solving large-sized MCFPs with nonlinear non-convex cost functions poses a much harder problem. In this paper, we propose a new representation scheme for solving non-convex MCFPs using genetic algorithms (GAs). The most common representation scheme for solving the MCFP in the literature using a GA is priority-based encoding, but it has some serious limitations including restricting the search space to a small part of the feasible set. We introduce a probabilistic tree-based representation scheme (PTbR) that is far superior compared to the priority-based encoding. Our extensive experimental investigations show the advantage of our encoding compared to previous methods for a variety of cost functions
Optimising a nonlinear utility function in multi-objective integer programming
In this paper we develop an algorithm to optimise a nonlinear utility
function of multiple objectives over the integer efficient set. Our approach is
based on identifying and updating bounds on the individual objectives as well
as the optimal utility value. This is done using already known solutions,
linear programming relaxations, utility function inversion, and integer
programming. We develop a general optimisation algorithm for use with k
objectives, and we illustrate our approach using a tri-objective integer
programming problem.Comment: 11 pages, 2 tables; v3: minor revisions, to appear in Journal of
Global Optimizatio
MicroRNA expression profiles in pediatric dysembryoplastic neuroepithelial tumors.
© Springer Science+Business Media New York 2015Among noncoding RNAs, microRNAs (miRNAs) have been most extensively studied, and their biology has repeatedly been proven critical for central nervous system pathological conditions. The diagnostic value of several miRNAs was appraised in pediatric dysembryoplastic neuroepithelial tumors (DNETs) using miRNA microarrays and receiving operating characteristic curves analyses. Overall, five pediatric DNETs were studied. As controls, 17 samples were used: the FirstChoice Human Brain Reference RNA and 16 samples from deceased children who underwent autopsy and were not present with any brain malignancy. The miRNA extraction was carried out using the mirVANA miRNA Isolation Kit, while the experimental approach included miRNA microarrays covering 1211 miRNAs. Quantitative real-time polymerase chain reaction was performed to validate the expression profiles of miR-1909* and miR-3138 in all samples initially screened with miRNA microarrays. Our findings indicated that miR-3138 might act as a tumor suppressor gene when down-regulated and miR-1909* as a putative oncogenic molecule when up-regulated in pediatric DNETs compared to the control cohort. Subsequently, both miRNA signatures might serve as putative diagnostic biomarkers for pediatric DNETs.Peer reviewedFinal Accepted Versio
Quantitative assessment of the spatial heterogeneity of tumor-infiltrating lymphocytes in breast cancer
A resampling-based meta-analysis for detection of differential gene expression in breast cancer
<p>Abstract</p> <p>Background</p> <p>Accuracy in the diagnosis of breast cancer and classification of cancer subtypes has improved over the years with the development of well-established immunohistopathological criteria. More recently, diagnostic gene-sets at the mRNA expression level have been tested as better predictors of disease state. However, breast cancer is heterogeneous in nature; thus extraction of differentially expressed gene-sets that stably distinguish normal tissue from various pathologies poses challenges. Meta-analysis of high-throughput expression data using a collection of statistical methodologies leads to the identification of robust tumor gene expression signatures.</p> <p>Methods</p> <p>A resampling-based meta-analysis strategy, which involves the use of resampling and application of distribution statistics in combination to assess the degree of significance in differential expression between sample classes, was developed. Two independent microarray datasets that contain normal breast, invasive ductal carcinoma (IDC), and invasive lobular carcinoma (ILC) samples were used for the meta-analysis. Expression of the genes, selected from the gene list for classification of normal breast samples and breast tumors encompassing both the ILC and IDC subtypes were tested on 10 independent primary IDC samples and matched non-tumor controls by real-time qRT-PCR. Other existing breast cancer microarray datasets were used in support of the resampling-based meta-analysis.</p> <p>Results</p> <p>The two independent microarray studies were found to be comparable, although differing in their experimental methodologies (Pearson correlation coefficient, R = 0.9389 and R = 0.8465 for ductal and lobular samples, respectively). The resampling-based meta-analysis has led to the identification of a highly stable set of genes for classification of normal breast samples and breast tumors encompassing both the ILC and IDC subtypes. The expression results of the selected genes obtained through real-time qRT-PCR supported the meta-analysis results.</p> <p>Conclusion</p> <p>The proposed meta-analysis approach has the ability to detect a set of differentially expressed genes with the least amount of within-group variability, thus providing highly stable gene lists for class prediction. Increased statistical power and stringent filtering criteria used in the present study also make identification of novel candidate genes possible and may provide further insight to improve our understanding of breast cancer development.</p
Flow shop rescheduling under different types of disruption
This is an Accepted Manuscript of an article published by Taylor & Francis in International Journal of Production Research on 2013, available online:http://www.tandfonline.com/10.1080/00207543.2012.666856Almost all manufacturing facilities need to use production planning and scheduling systems to increase productivity and to reduce production costs. Real-life production operations are subject to a large number of unexpected disruptions that may invalidate the original schedules. In these cases, rescheduling is essential to minimise the impact on the performance of the system. In this work we consider flow shop layouts that have seldom been studied in the rescheduling literature. We generate and employ three types of disruption that interrupt the original schedules simultaneously. We develop rescheduling algorithms to finally accomplish the twofold objective of establishing a standard framework on the one hand, and proposing rescheduling methods that seek a good trade-off between schedule quality and stability on the other.The authors would like to thank the anonymous referees for their careful and detailed comments that helped to improve the paper considerably. This work is partially financed by the Small and Medium Industry of the Generalitat Valenciana (IMPIVA) and by the European Union through the European Regional Development Fund (FEDER) inside the R + D program "Ayudas dirigidas a Institutos tecnologicos de la Red IMPIVA" during the year 2011, with project number IMDEEA/2011/142.Katragjini Prifti, K.; Vallada Regalado, E.; Ruiz García, R. (2013). Flow shop rescheduling under different types of disruption. International Journal of Production Research. 51(3):780-797. https://doi.org/10.1080/00207543.2012.666856S780797513Abumaizar, R. J., & Svestka, J. A. (1997). Rescheduling job shops under random disruptions. International Journal of Production Research, 35(7), 2065-2082. doi:10.1080/002075497195074Adiri, I., Frostig, E., & Kan, A. H. G. R. (1991). Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs. Naval Research Logistics, 38(2), 261-271. doi:10.1002/1520-6750(199104)38:23.0.co;2-iAkturk, M. S., & Gorgulu, E. (1999). Match-up scheduling under a machine breakdown. European Journal of Operational Research, 112(1), 81-97. doi:10.1016/s0377-2217(97)00396-2Allahverdi, A. (1996). Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness. Computers & Operations Research, 23(10), 909-916. doi:10.1016/0305-0548(96)00012-3Arnaout, J. P., & Rabadi, G. (2008). Rescheduling of unrelated parallel machines under machine breakdowns. International Journal of Applied Management Science, 1(1), 75. doi:10.1504/ijams.2008.020040Artigues, C., Billaut, J.-C., & Esswein, C. (2005). Maximization of solution flexibility for robust shop scheduling. European Journal of Operational Research, 165(2), 314-328. doi:10.1016/j.ejor.2004.04.004Azizoglu, M., & Alagöz, O. (2005). Parallel-machine rescheduling with machine disruptions. IIE Transactions, 37(12), 1113-1118. doi:10.1080/07408170500288133Bean, J. C., Birge, J. R., Mittenthal, J., & Noon, C. E. (1991). Matchup Scheduling with Multiple Resources, Release Dates and Disruptions. Operations Research, 39(3), 470-483. doi:10.1287/opre.39.3.470Caricato, P., & Grieco, A. (2008). An online approach to dynamic rescheduling for production planning applications. International Journal of Production Research, 46(16), 4597-4617. doi:10.1080/00207540601136225CHURCH, L. K., & UZSOY, R. (1992). Analysis of periodic and event-driven rescheduling policies in dynamic shops. International Journal of Computer Integrated Manufacturing, 5(3), 153-163. doi:10.1080/09511929208944524Cowling, P., & Johansson, M. (2002). Using real time information for effective dynamic scheduling. European Journal of Operational Research, 139(2), 230-244. doi:10.1016/s0377-2217(01)00355-1Curry, J., & Peters *, B. (2005). Rescheduling parallel machines with stepwise increasing tardiness and machine assignment stability objectives. International Journal of Production Research, 43(15), 3231-3246. doi:10.1080/00207540500103953DUTTA, A. (1990). Reacting to Scheduling Exceptions in FMS Environments. IIE Transactions, 22(4), 300-314. doi:10.1080/07408179008964185Ghezail, F., Pierreval, H., & Hajri-Gabouj, S. (2010). Analysis of robustness in proactive scheduling: A graphical approach. Computers & Industrial Engineering, 58(2), 193-198. doi:10.1016/j.cie.2009.03.004Goren, S., & Sabuncuoglu, I. (2008). Robustness and stability measures for scheduling: single-machine environment. IIE Transactions, 40(1), 66-83. doi:10.1080/07408170701283198Hall, N. G., & Potts, C. N. (2004). Rescheduling for New Orders. Operations Research, 52(3), 440-453. doi:10.1287/opre.1030.0101Herrmann, J. W., Lee, C.-Y., & Snowdon, J. L. (1993). A Classification of Static Scheduling Problems. Complexity in Numerical Optimization, 203-253. doi:10.1142/9789814354363_0011Herroelen, W., & Leus, R. (2005). Project scheduling under uncertainty: Survey and research potentials. European Journal of Operational Research, 165(2), 289-306. doi:10.1016/j.ejor.2004.04.002Hozak, K., & Hill, J. A. (2009). Issues and opportunities regarding replanning and rescheduling frequencies. International Journal of Production Research, 47(18), 4955-4970. doi:10.1080/00207540802047106Huaccho Huatuco, L., Efstathiou, J., Calinescu, A., Sivadasan, S., & Kariuki, S. (2009). Comparing the impact of different rescheduling strategies on the entropic-related complexity of manufacturing systems. International Journal of Production Research, 47(15), 4305-4325. doi:10.1080/00207540701871036Jensen, M. T. (2003). Generating robust and flexible job shop schedules using genetic algorithms. IEEE Transactions on Evolutionary Computation, 7(3), 275-288. doi:10.1109/tevc.2003.810067King, J. R. (1976). The theory-practice gap in job-shop scheduling. Production Engineer, 55(3), 137. doi:10.1049/tpe.1976.0044Kopanos, G. M., Capón-García, E., Espuña,, A., & Puigjaner, L. (2008). Costs for Rescheduling Actions: A Critical Issue for Reducing the Gap between Scheduling Theory and Practice. Industrial & Engineering Chemistry Research, 47(22), 8785-8795. doi:10.1021/ie8005676Lee, C.-Y., Leung, J. Y.-T., & Yu, G. (2006). Two Machine Scheduling under Disruptions with Transportation Considerations. Journal of Scheduling, 9(1), 35-48. doi:10.1007/s10951-006-5592-7Li, Z., & Ierapetritou, M. (2008). Process scheduling under uncertainty: Review and challenges. Computers & Chemical Engineering, 32(4-5), 715-727. doi:10.1016/j.compchemeng.2007.03.001Liao, C. J., & Chen, W. J. (2004). Scheduling under machine breakdown in a continuous process industry. Computers & Operations Research, 31(3), 415-428. doi:10.1016/s0305-0548(02)00224-1Mehta, S. V. (1999). Predictable scheduling of a single machine subject to breakdowns. International Journal of Computer Integrated Manufacturing, 12(1), 15-38. doi:10.1080/095119299130443MUHLEMANN, A. P., LOCKETT, A. G., & FARN, C.-K. (1982). Job shop scheduling heuristics and frequency of scheduling. International Journal of Production Research, 20(2), 227-241. doi:10.1080/00207548208947763Nawaz, M., Enscore, E. E., & Ham, I. (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, 11(1), 91-95. doi:10.1016/0305-0483(83)90088-9O’Donovan, R., Uzsoy, R., & McKay, K. N. (1999). Predictable scheduling of a single machine with breakdowns and sensitive jobs. International Journal of Production Research, 37(18), 4217-4233. doi:10.1080/002075499189745Özlen, M., & Azizoğlu, M. (2009). Generating all efficient solutions of a rescheduling problem on unrelated parallel machines. International Journal of Production Research, 47(19), 5245-5270. doi:10.1080/00207540802043998Pfeiffer, A., Kádár, B., & Monostori, L. (2007). Stability-oriented evaluation of rescheduling strategies, by using simulation. Computers in Industry, 58(7), 630-643. doi:10.1016/j.compind.2007.05.009Pierreval, H., & Durieux-Paris, S. (2007). Robust simulation with a base environmental scenario. European Journal of Operational Research, 182(2), 783-793. doi:10.1016/j.ejor.2006.07.045Damodaran, P., Hirani, N. S., & Gallego, M. C. V. (2009). Scheduling identical parallel batch processing machines to minimise makespan using genetic algorithms. European J. of Industrial Engineering, 3(2), 187. doi:10.1504/ejie.2009.023605Qi, X., Bard, J. F., & Yu, G. (2006). Disruption management for machine scheduling: The case of SPT schedules. International Journal of Production Economics, 103(1), 166-184. doi:10.1016/j.ijpe.2005.05.021Rangsaritratsamee, R., Ferrell, W. G., & Kurz, M. B. (2004). Dynamic rescheduling that simultaneously considers efficiency and stability. Computers & Industrial Engineering, 46(1), 1-15. doi:10.1016/j.cie.2003.09.007Ruiz, R., & Stützle, T. (2007). A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research, 177(3), 2033-2049. doi:10.1016/j.ejor.2005.12.009Sabuncuoglu, I., & Goren, S. (2009). Hedging production schedules against uncertainty in manufacturing environment with a review of robustness and stability research. International Journal of Computer Integrated Manufacturing, 22(2), 138-157. doi:10.1080/09511920802209033Sabuncuoglu, I., & Kizilisik, O. B. (2003). Reactive scheduling in a dynamic and stochastic FMS environment. International Journal of Production Research, 41(17), 4211-4231. doi:10.1080/0020754031000149202Salveson, M. E. (1952). On a Quantitative Method in Production Planning and Scheduling. Econometrica, 20(4), 554. doi:10.2307/1907643Samarghandi, H., & ElMekkawy, T. Y. (2011). An efficient hybrid algorithm for the two-machine no-wait flow shop problem with separable setup times and single server. European J. of Industrial Engineering, 5(2), 111. doi:10.1504/ejie.2011.039869Subramaniam *, V., Raheja, A. S., & Rama Bhupal Reddy, K. (2005). Reactive repair tool for job shop schedules. International Journal of Production Research, 43(1), 1-23. doi:10.1080/0020754042000270412Taillard, E. (1990). Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research, 47(1), 65-74. doi:10.1016/0377-2217(90)90090-xTaillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2), 278-285. doi:10.1016/0377-2217(93)90182-mValente, J. M. S., & Schaller, J. E. (2010). Improved heuristics for the single machine scheduling problem with linear early and quadratic tardy penalties. European J. of Industrial Engineering, 4(1), 99. doi:10.1504/ejie.2010.029572Vallada, E., & Ruiz, R. (2010). Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem☆. Omega, 38(1-2), 57-67. doi:10.1016/j.omega.2009.04.002Vieira, G. E., Herrmann, J. W., & Lin, E. (2000). Predicting the performance of rescheduling strategies for parallel machine systems. Journal of Manufacturing Systems, 19(4), 256-266. doi:10.1016/s0278-6125(01)80005-4Vieira, G. E., Herrmann, J. W., & Lin, E. (2003). Journal of Scheduling, 6(1), 39-62. doi:10.1023/a:1022235519958Yang, J., & Yu, G. (2002). Journal of Combinatorial Optimization, 6(1), 17-33. doi:10.1023/a:1013333232691Zandieh, M., & Gholami, M. (2009). An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns. International Journal of Production Research, 47(24), 6999-7027. doi:10.1080/0020754080240063
Remembrance of things past: an inquiry into the fate of the Istanbul medical students who fought in the Gallipoli campaign
During the Great War, university students, like all young men at the age of military service, were called up as part of the general conscription in the Ottoman Empire. According to a popular story, which is the subject of this study, all Darulfunun (today Istanbul University) students who took part in the Gallipoli campaign as volunteers in May, 1915, were annihilated in the May 19th attack. As all students of 1915 were lost, the medical school was said to have had no graduates in 1921. This investigation was carried out, using material from the university and military archives, to identify the medical students who died on the Gallipoli battlefield, and to clarify their situation at that time. It was found that, as academic staff and students were distributed to the troops, education never commenced in 1915 and that the faculty building was closed for more than a year to serve as an inland war hospital. As all students were drafted into the army, there were no graduates in 1915. While it has been possible to identify eight physicians who died on the Gallipoli battlefield, no records were found concerning the medical students who were killed at Gallipoli. (c) 2004 Published by Elsevier Ltd
A medical class lost at Gallipoli
In 1915, the second year of the First World War, one of the big battles was the Gallipoli Campaign. Many students of the Istanbul Darulfunun (today Istanbul University) and of the Istanbul Men's High School joined the second battalion to participate in the defence of the Dardanelles as volunteers. All of the soldiers of that battalion died in 19 May 1915. The Medical School of Darulfunun, which lost all of the students of the class of 1915, had no student to graduate in 1921. (C) 2002 Elsevier Science Ltd. All rights reserved