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

Functionalization of Carbon Nanomaterial Surface by Doxorubicin and Antibodies to Tumor Markers

The actual task of oncology is effective treatment of cancer while causing a minimum harm to the patient. The appearance of polymer nanomaterials and technologies launched new applications and approaches of delivery and release of anticancer drugs. The goal of work was to test ultra dispersed diamonds (UDDs) and onion-like carbon (OLCs) as new vehicles for delivery of antitumor drug (doxorubicin (DOX)) and specific antibodies to tumor receptors. Stable compounds of UDDs and OLCs with DOX were obtained. As results of work, an effectiveness of functionalization was 2.94 % w/w for OLC-DOX and 2.98 % w/w for UDD-DOX. Also, there was demonstrated that UDD-DOX and OLC-DOX constructs had dose-dependent cytotoxic effect on tumor cells in the presence of trypsin. The survival of adenocarcinoma cells reduced from 52 to 28 % in case of incubation with the UDD-DOX in concentrations from 8.4–2.5 to 670–20 μg/ml and from 72 to 30 % after incubation with OLC-DOX. Simultaneously, antibodies to epidermal growth factor maintained 75 % of the functional activity and specificity after matrix-assisted pulsed laser evaporation deposition. Thus, the conclusion has been made about the prospects of selected new methods and approaches for creating an antitumor agent with capabilities targeted delivery of drugs

Cerebral microdialysis in clinical studies of drugs: pharmacokinetic applications

The ability to deliver drug molecules effectively across the blood–brain barrier into the brain is important in the development of central nervous system (CNS) therapies. Cerebral microdialysis is the only existing technique for sampling molecules from the brain extracellular fluid (ECF; also termed interstitial fluid), the compartment to which the astrocytes and neurones are directly exposed. Plasma levels of drugs are often poor predictors of CNS activity. While cerebrospinal fluid (CSF) levels of drugs are often used as evidence of delivery of drug to brain, the CSF is a different compartment to the ECF. The continuous nature of microdialysis sampling of the ECF is ideal for pharmacokinetic (PK) studies, and can give valuable PK information of variations with time in drug concentrations of brain ECF versus plasma. The microdialysis technique needs careful calibration for relative recovery (extraction efficiency) of the drug if absolute quantification is required. Besides the drug, other molecules can be analysed in the microdialysates for information on downstream targets and/or energy metabolism in the brain. Cerebral microdialysis is an invasive technique, so is only useable in patients requiring neurocritical care, neurosurgery or brain biopsy. Application of results to wider patient populations, and to those with different pathologies or degrees of pathology, obviously demands caution. Nevertheless, microdialysis data can provide valuable guidelines for designing CNS therapies, and play an important role in small phase II clinical trials. In this review, we focus on the role of cerebral microdialysis in recent clinical studies of antimicrobial agents, drugs for tumour therapy, neuroprotective agents and anticonvulsants

CsPbBr3 deposited by laser ablation: effects of post-growth aging, oxygen adsorption and annealing on film properties

All-inorganic perovskites are widely investigated as a new generation of materials thanks to their superior optoelectronic properties and better stability than hybrid organic-inorganic perovskites. In particular, cesium lead bromide (CsPbBr3) exhibits advantageous properties for numerous applicative fields (photovoltaics, light-emitting diodes, photodetectors, lasing, field effect transistors, and ionizing radiation detectors). The performance of CsPbBr3 being critically dependent on the deposition technique, proper understanding and optimization of the fabrication process are demanding. Despite the well-known potentiality of the Pulsed Laser Deposition (PLD) technique in depositing films with complex stoichiometry, a very limited number of literature studies report on the successful deposition of CsPbBr3 films by PLD. Recently, the authors disclosed the impact of the uneven masses of Cs, Pb, and Br on the film stoichiometry and guidelines to recover the desired composition. Herein, we exploit stoichiometric mechano-chemically synthesized targets to deposit, by nanosecond-PLD (lambda = 248 nm, tau = 20 ns, room temperature, fluence of 1 J/cm(2)), CsPbBr3 films to be studied following time aging, thermal heating and exposure to high relative humidity. Even in the presence of the characteristic absorption peak at similar to 520 nm, the freshly deposited film shows no photoluminescence. Photoluminescence is switched on by thermal annealing (at 250 and 350 degrees C) or after a few days (at least 15) of exposure to air and it persists over time. Films present interesting morphology evolution and oxygen adsorption following heating

MAPLE deposition of methoxy Ge triphenylcorrole thin films

Methoxy Ge Triphenylcorrole [Ge(TPC)OCH3] has been recently synthesized and deposited as thin film by the Matrix Assisted Pulsed Laser Evaporation (MAPLE) technique. In the last few years, corroles have been the object of an increasing number of studies and MAPLE technique seems to be a very promising deposition method for organic and polymeric films, producing good results for applications in chemical gas sensing layers production. In this work Ge(TPC)OCH3 thin films were deposited by both spin coating and MAPLE techniques for comparison. The morphology of the films was investigated by Atomic Force Microscopy (AFM), while their optical properties were analyzed by photoluminescence (PL) and UV-vis absorption measurements and were compared with the ones of the starting solution. The film absorption spectrum presented the same peaks with the same relative intensities of that recorded in solution. The luminescence spectra were acquired periodically to evaluate the aging effects and no detectable variations were recorded over a period of 1 month

MAGIC-5: an Italian mammographic database of digitised images for research.

The implementation of a database of digitised mammograms is discussed. The digitised images were collected beginning in 1999 by a community of physicists in collaboration with radiologists in several Italian hospitals as a first step in developing and implementing a computer-aided detection (CAD) system. All 3,369 mammograms were collected from 967 patients and classified according to lesion type and morphology, breast tissue and pathology type. A dedicated graphical user interface was developed to visualise and process mammograms to support the medical diagnosis directly on a high-resolution screen. The database has been the starting point for developing other medical imaging applications, such as a breast CAD, currently being upgraded and optimised for use in a distributed environment with grid services, in the framework of the Instituto Nazionale di Fisicia Nucleare (INFN)-funded Medical Applications on a Grid Infrastructure Connection (MAGIC)-5 project. RI Oliva, Piernicola/E-5839-201