The Project Scheduling Problem with Non-Deterministic Activities Duration: A Literature Review

Purpose: The goal of this article is to provide an extensive literature review of the models and solution procedures proposed by many researchers interested on the Project Scheduling Problem with nondeterministic activities duration. Design/methodology/approach: This paper presents an exhaustive literature review, identifying the existing models where the activities duration were taken as uncertain or random parameters. In order to get published articles since 1996, was employed the Scopus database. The articles were selected on the basis of reviews of abstracts, methodologies, and conclusions. The results were classified according to following characteristics: year of publication, mathematical representation of the activities duration, solution techniques applied, and type of problem solved. Findings: Genetic Algorithms (GA) was pointed out as the main solution technique employed by researchers, and the Resource-Constrained Project Scheduling Problem (RCPSP) as the most studied type of problem. On the other hand, the application of new solution techniques, and the possibility of incorporating traditional methods into new PSP variants was presented as research trends. Originality/value: This literature review contents not only a descriptive analysis of the published articles but also a statistical information section in order to examine the state of the research activity carried out in relation to the Project Scheduling Problem with non-deterministic activities duration.Peer Reviewe

Project scheduling under undertainty – survey and research potentials.

The vast majority of the research efforts in project scheduling assume complete information about the scheduling problem to be solved and a static deterministic environment within which the pre-computed baseline schedule will be executed. However, in the real world, project activities are subject to considerable uncertainty, that is gradually resolved during project execution. In this survey we review the fundamental approaches for scheduling under uncertainty: reactive scheduling, stochastic project scheduling, stochastic GERT network scheduling, fuzzy project scheduling, robust (proactive) scheduling and sensitivity analysis. We discuss the potentials of these approaches for scheduling projects under uncertainty.Management; Project management; Robustness; Scheduling; Stability;

Pre-emptive resource-constrained multimode project scheduling using genetic algorithm: a dynamic forward approach

Purpose: The issue resource over-allocating is a big concern for project engineers in the process of scheduling project activities. Resource over-allocating drawback is frequently seen after scheduling of a project in practice which causes a schedule to be useless. Modifying an over-allocated schedule is very complicated and needs a lot of efforts and time. In this paper, a new and fast tracking method is proposed to schedule large scale projects which can help project engineers to schedule the project rapidly and with more confidence. Design/methodology/approach: In this article, a forward approach for maximizing net present value (NPV) in multi-mode resource constrained project scheduling problem while assuming discounted positive cash flows (MRCPSP-DCF) is proposed. The progress payment method is used and all resources are considered as pre-emptible. The proposed approach maximizes NPV using unscheduled resources through resource calendar in forward mode. For this purpose, a Genetic Algorithm is applied to solve. Findings: The findings show that the proposed method is an effective way to maximize NPV in MRCPSP-DCF problems while activity splitting is allowed. The proposed algorithm is very fast and can schedule experimental cases with 1000 variables and 100 resources in few seconds. The results are then compared with branch and bound method and simulated annealing algorithm and it is found the proposed genetic algorithm can provide results with better quality. Then algorithm is then applied for scheduling a hospital in practice. Originality/value: The method can be used alone or as a macro in Microsoft Office Project® Software to schedule MRCPSP-DCF problems or to modify resource over-allocated activities after scheduling a project. This can help project engineers to schedule project activities rapidly with more accuracy in practice.Peer Reviewe

The Fuzzy Project Scheduling Problem with Minimal Generalized Precedence Relations

In scheduling, estimations are affected by the imprecision of limited information on future events, and the reduction in the number and level of detail of activities. Overlapping of processes and activities requires the study of their continuity, along with analysis of the risks associated with imprecision. In this line, this paper proposes a fuzzy heuristic model for the Project Scheduling Problem with flows and minimal feeding, time and work Generalized Precedence Relations with a realistic approach to overlapping, in which the continuity of processes and activities is allowed in a discretionary way. This fuzzy algorithm handles the balance of process flows, and computes the optimal fragmentation of tasks, avoiding the interruption of the critical path and reverse criticality. The goodness of this approach is tested on several problems found in the literature; furthermore, an example of a 15-story building was used to compare the better performance of the algorithm implemented in Visual Basic for Applications (Excel) over that same example input in Primavera© P6 Professional V8.2.0, using five different scenarios.This research was supported by the FAPA program of Universidad de Los Andes, Colombia. The authors would like to thank the research group of Construction Engineering and Management (INgeco) of Universidad de Los Andes, and the five anonymous referees for their helpful and constructive suggestions.Ponz Tienda, JL.; Pellicer Armiñana, E.; Benlloch Marco, J.; Andrés Romano, C. (2015). The Fuzzy Project Scheduling Problem with Minimal Generalized Precedence Relations. Computer-Aided Civil and Infrastructure Engineering. 30(11):872-891. doi:10.1111/mice.12166S8728913011Adeli, H., & Park, H. S. (1995). Optimization of space structures by neural dynamics. Neural Networks, 8(5), 769-781. doi:10.1016/0893-6080(95)00026-vAdeli, H., & Karim, A. (1997). Scheduling/Cost Optimization and Neural Dynamics Model for Construction. Journal of Construction Engineering and Management, 123(4), 450-458. doi:10.1061/(asce)0733-9364(1997)123:4(450)Adeli, H., & Wu, M. (1998). Regularization Neural Network for Construction Cost Estimation. Journal of Construction Engineering and Management, 124(1), 18-24. doi:10.1061/(asce)0733-9364(1998)124:1(18)Alarcón, L. F., Ashley, D. B., de Hanily, A. S., Molenaar, K. R., & Ungo, R. (2011). Risk Planning and Management for the Panama Canal Expansion Program. Journal of Construction Engineering and Management, 137(10), 762-771. doi:10.1061/(asce)co.1943-7862.0000317Ammar, M. A. (2013). LOB and CPM Integrated Method for Scheduling Repetitive Projects. Journal of Construction Engineering and Management, 139(1), 44-50. doi:10.1061/(asce)co.1943-7862.0000569Arditi, D., & Bentotage, S. N. (1996). System for Scheduling Highway Construction Projects. Computer-Aided Civil and Infrastructure Engineering, 11(2), 123-139. doi:10.1111/j.1467-8667.1996.tb00316.xBai, L., Yan, L., & Ma, Z. M. (2014). Querying fuzzy spatiotemporal data using XQuery. Integrated Computer-Aided Engineering, 21(2), 147-162. doi:10.3233/ica-130454Ballesteros-Pérez, P., González-Cruz, M. C., Cañavate-Grimal, A., & Pellicer, E. (2013). Detecting abnormal and collusive bids in capped tendering. Automation in Construction, 31, 215-229. doi:10.1016/j.autcon.2012.11.036Bartusch, M., Möhring, R. H., & Radermacher, F. J. (1988). Scheduling project networks with resource constraints and time windows. Annals of Operations Research, 16(1), 199-240. doi:10.1007/bf02283745Bianco, L., & Caramia, M. (2011). Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound. 4OR, 9(4), 371-389. doi:10.1007/s10288-011-0168-6Bonnal, P., Gourc, D., & Lacoste, G. (2004). Where Do We Stand with Fuzzy Project Scheduling? Journal of Construction Engineering and Management, 130(1), 114-123. doi:10.1061/(asce)0733-9364(2004)130:1(114)Brunelli, M., & Mezei, J. (2013). How different are ranking methods for fuzzy numbers? A numerical study. International Journal of Approximate Reasoning, 54(5), 627-639. doi:10.1016/j.ijar.2013.01.009Buckley, J. J., & Eslami, E. (2002). An Introduction to Fuzzy Logic and Fuzzy Sets. doi:10.1007/978-3-7908-1799-7Castro-Lacouture, D., Süer, G. A., Gonzalez-Joaqui, J., & Yates, J. K. (2009). Construction Project Scheduling with Time, Cost, and Material Restrictions Using Fuzzy Mathematical Models and Critical Path Method. Journal of Construction Engineering and Management, 135(10), 1096-1104. doi:10.1061/(asce)0733-9364(2009)135:10(1096)Chanas, S., & Kamburowski, J. (1981). The use of fuzzy variables in pert. Fuzzy Sets and Systems, 5(1), 11-19. doi:10.1016/0165-0114(81)90030-0In Seong Chang, Yasuhiro Tsujimura, Mitsuo Gen, & Tatsumi Tozawa. (1995). An efficient approach for large scale project planning based on fuzzy Delphi method. Fuzzy Sets and Systems, 76(3), 277-288. doi:10.1016/0165-0114(94)00385-4Chen, C.-T., & Huang, S.-F. (2007). Applying fuzzy method for measuring criticality in project network. Information Sciences, 177(12), 2448-2458. doi:10.1016/j.ins.2007.01.035Shyi-Ming Chen, & Tao-Hsing Chang. (2001). Finding multiple possible critical paths using fuzzy PERT. IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), 31(6), 930-937. doi:10.1109/3477.969496Damci, A., Arditi, D., & Polat, G. (2013). Resource Leveling in Line-of-Balance Scheduling. Computer-Aided Civil and Infrastructure Engineering, 28(9), 679-692. doi:10.1111/mice.12038Dell’Orco, M., & Mellano, M. (2013). A New User-Oriented Index, Based on a Fuzzy Inference System, for Quality Evaluation of Rural Roads. Computer-Aided Civil and Infrastructure Engineering, 28(8), 635-647. doi:10.1111/mice.12021Deng, H. (2014). Comparing and ranking fuzzy numbers using ideal solutions. Applied Mathematical Modelling, 38(5-6), 1638-1646. doi:10.1016/j.apm.2013.09.012De Reyck, B., & Herroelen, willy. (1998). A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations. European Journal of Operational Research, 111(1), 152-174. doi:10.1016/s0377-2217(97)00305-6De Reyck, B., & Herroelen, W. (1999). The multi-mode resource-constrained project scheduling problem with generalized precedence relations. European Journal of Operational Research, 119(2), 538-556. doi:10.1016/s0377-2217(99)00151-4Dubois, D., Fargier, H., & Galvagnon, V. (2003). On latest starting times and floats in activity networks with ill-known durations. European Journal of Operational Research, 147(2), 266-280. doi:10.1016/s0377-2217(02)00560-xElmaghraby, S. E., & Kamburowski, J. (1992). The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs). Management Science, 38(9), 1245-1263. doi:10.1287/mnsc.38.9.1245Fondahl , J. W. 1961 A Non-Computer Approach to the Critical Path Method for the Construction IndustryFougères, A.-J., & Ostrosi, E. (2013). Fuzzy agent-based approach for consensual design synthesis in product configuration. Integrated Computer-Aided Engineering, 20(3), 259-274. doi:10.3233/ica-130434Gil-Aluja, J. (2004). Fuzzy Sets in the Management of Uncertainty. Studies in Fuzziness and Soft Computing. doi:10.1007/978-3-540-39699-4Hajdu, M. (1997). Network Scheduling Techniques for Construction Project Management. Nonconvex Optimization and Its Applications. doi:10.1007/978-1-4757-5951-8Harris, R. B., & Ioannou, P. G. (1998). Scheduling Projects with Repeating Activities. Journal of Construction Engineering and Management, 124(4), 269-278. doi:10.1061/(asce)0733-9364(1998)124:4(269)Hejducki, Z. (2004). Sequencing problems in methods of organising construction processes. Engineering, Construction and Architectural Management, 11(1), 20-32. doi:10.1108/09699980410512638Hebert, J. E., & Deckro, R. F. (2011). Combining contemporary and traditional project management tools to resolve a project scheduling problem. Computers & Operations Research, 38(1), 21-32. doi:10.1016/j.cor.2009.12.004Herroelen, 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.002IBM 1968Jahani, E., Muhanna, R. L., Shayanfar, M. A., & Barkhordari, M. A. (2013). Reliability Assessment with Fuzzy Random Variables Using Interval Monte Carlo Simulation. Computer-Aided Civil and Infrastructure Engineering, 29(3), 208-220. doi:10.1111/mice.12028Karim, A., & Adeli, H. (1999). OO Information Model for Construction Project Management. Journal of Construction Engineering and Management, 125(5), 361-367. doi:10.1061/(asce)0733-9364(1999)125:5(361)Karim, A., & Adeli, H. (1999). CONSCOM: An OO Construction Scheduling and Change Management System. Journal of Construction Engineering and Management, 125(5), 368-376. doi:10.1061/(asce)0733-9364(1999)125:5(368)KARIM, A., & ADELI, H. (1999). A new generation software for construction scheduling and management. Engineering, Construction and Architectural Management, 6(4), 380-390. doi:10.1108/eb021126Kim, S.-G. (2012). CPM Schedule Summarizing Function of the Beeline Diagramming Method. Journal of Asian Architecture and Building Engineering, 11(2), 367-374. doi:10.3130/jaabe.11.367Kis, T. (2005). A branch-and-cut algorithm for scheduling of projects with variable-intensity activities. Mathematical Programming, 103(3), 515-539. doi:10.1007/s10107-004-0551-6Kolisch, R., & Sprecher, A. (1997). PSPLIB - A project scheduling problem library. European Journal of Operational Research, 96(1), 205-216. doi:10.1016/s0377-2217(96)00170-1Krishnan, V., Eppinger, S. D., & Whitney, D. E. (1997). A Model-Based Framework to Overlap Product Development Activities. Management Science, 43(4), 437-451. doi:10.1287/mnsc.43.4.437LEACHMAN, R. C., DTNCERLER, A., & KIM, S. (1990). Resource-Constrained Scheduling of Projects with Variable-Intensity Activities. IIE Transactions, 22(1), 31-40. doi:10.1080/07408179008964155Lim, T.-K., Yi, C.-Y., Lee, D.-E., & Arditi, D. (2014). Concurrent Construction Scheduling Simulation Algorithm. Computer-Aided Civil and Infrastructure Engineering, 29(6), 449-463. doi:10.1111/mice.12073Long, L. D., & Ohsato, A. (2008). Fuzzy critical chain method for project scheduling under resource constraints and uncertainty. International Journal of Project Management, 26(6), 688-698. doi:10.1016/j.ijproman.2007.09.012Lootsma, F. A. (1989). Stochastic and fuzzy Pert. European Journal of Operational Research, 43(2), 174-183. doi:10.1016/0377-2217(89)90211-7Malcolm, D. G., Roseboom, J. H., Clark, C. E., & Fazar, W. (1959). Application of a Technique for Research and Development Program Evaluation. Operations Research, 7(5), 646-669. doi:10.1287/opre.7.5.646Maravas, A., & Pantouvakis, J.-P. (2011). Fuzzy Repetitive Scheduling Method for Projects with Repeating Activities. Journal of Construction Engineering and Management, 137(7), 561-564. doi:10.1061/(asce)co.1943-7862.0000319PONZ TIENDA, J. L., BENLLOCH MARCO, J., ANDRÉS ROMANO, C., & SENABRE, D. (2011). Un algoritmo matricial RUPSP / GRUPSP «sin interrupción» para la planificación de la producción bajo metodología Lean Construction basado en procesos productivos. Revista de la construcción, 10(2), 90-103. doi:10.4067/s0718-915x2011000200009Ponz-Tienda, J. L., Pellicer, E., & Yepes, V. (2012). Complete fuzzy scheduling and fuzzy earned value management in construction projects. Journal of Zhejiang University SCIENCE A, 13(1), 56-68. doi:10.1631/jzus.a1100160Ponz-Tienda, J. L., Yepes, V., Pellicer, E., & Moreno-Flores, J. (2013). The Resource Leveling Problem with multiple resources using an adaptive genetic algorithm. Automation in Construction, 29, 161-172. doi:10.1016/j.autcon.2012.10.003Prade, H. (1979). Using fuzzy set theory in a scheduling problem: A case study. Fuzzy Sets and Systems, 2(2), 153-165. doi:10.1016/0165-0114(79)90022-8Quintanilla, S., Pérez, Á., Lino, P., & Valls, V. (2012). Time and work generalised precedence relationships in project scheduling with pre-emption: An application to the management of Service Centres. European Journal of Operational Research, 219(1), 59-72. doi:10.1016/j.ejor.2011.12.018Rommelfanger, H. J. (1994). Network analysis and information flow in fuzzy environment. Fuzzy Sets and Systems, 67(1), 119-128. doi:10.1016/0165-0114(94)90212-7Senouci, A. B., & Adeli, H. (2001). Resource Scheduling Using Neural Dynamics Model of Adeli and Park. Journal of Construction Engineering and Management, 127(1), 28-34. doi:10.1061/(asce)0733-9364(2001)127:1(28)Seppänen, O., Evinger, J., & Mouflard, C. (2014). Effects of the location-based management system on production rates and productivity. Construction Management and Economics, 32(6), 608-624. doi:10.1080/01446193.2013.853881Shi, Q., & Blomquist, T. (2012). A new approach for project scheduling using fuzzy dependency structure matrix. International Journal of Project Management, 30(4), 503-510. doi:10.1016/j.ijproman.2011.11.003Srour, I. M., Abdul-Malak, M.-A. U., Yassine, A. A., & Ramadan, M. (2013). A methodology for scheduling overlapped design activities based on dependency information. Automation in Construction, 29, 1-11. doi:10.1016/j.autcon.2012.08.001Valls, V., & Lino, P. (2001). Annals of Operations Research, 102(1/4), 17-37. doi:10.1023/a:1010941729204Valls, V., Mart�, R., & Lino, P. (1996). A heuristic algorithm for project scheduling with splitting allowed. Journal of Heuristics, 2(1), 87-104. doi:10.1007/bf00226294Wang, Y.-M., Yang, J.-B., Xu, D.-L., & Chin, K.-S. (2006). On the centroids of fuzzy numbers. Fuzzy Sets and Systems, 157(7), 919-926. doi:10.1016/j.fss.2005.11.006Wiest, J. D. (1981). Precedence diagramming method: Some unusual characteristics and their implications for project managers. Journal of Operations Management, 1(3), 121-130. doi:10.1016/0272-6963(81)90015-2Yan, L., & Ma, Z. M. (2013). Conceptual design of object-oriented databases for fuzzy engineering information modeling. Integrated Computer-Aided Engineering, 20(2), 183-197. doi:10.3233/ica-130427Zadeh, L. A. (1965). Fuzzy sets. Information and Control, 8(3), 338-353. doi:10.1016/s0019-9958(65)90241-xZeng, Z., Xu, J., Wu, S., & Shen, M. (2014). Antithetic Method-Based Particle Swarm Optimization for a Queuing Network Problem with Fuzzy Data in Concrete Transportation Systems. Computer-Aided Civil and Infrastructure Engineering, 29(10), 771-800. doi:10.1111/mice.12111Zhang, X., Li, Y., Zhang, S., & Schlick, C. M. (2013). Modelling and simulation of the task scheduling behavior in collaborative product development process. Integrated Computer-Aided Engineering, 20(1), 31-44. doi:10.3233/ica-12041

Working Notes from the 1992 AAAI Spring Symposium on Practical Approaches to Scheduling and Planning

The symposium presented issues involved in the development of scheduling systems that can deal with resource and time limitations. To qualify, a system must be implemented and tested to some degree on non-trivial problems (ideally, on real-world problems). However, a system need not be fully deployed to qualify. Systems that schedule actions in terms of metric time constraints typically represent and reason about an external numeric clock or calendar and can be contrasted with those systems that represent time purely symbolically. The following topics are discussed: integrating planning and scheduling; integrating symbolic goals and numerical utilities; managing uncertainty; incremental rescheduling; managing limited computation time; anytime scheduling and planning algorithms, systems; dependency analysis and schedule reuse; management of schedule and plan execution; and incorporation of discrete event techniques

The 1990 progress report and future plans

This document describes the progress and plans of the Artificial Intelligence Research Branch (RIA) at ARC in 1990. Activities span a range from basic scientific research to engineering development and to fielded NASA applications, particularly those applications that are enabled by basic research carried out at RIA. Work is conducted in-house and through collaborative partners in academia and industry. Our major focus is on a limited number of research themes with a dual commitment to technical excellence and proven applicability to NASA short, medium, and long-term problems. RIA acts as the Agency's lead organization for research aspects of artificial intelligence, working closely with a second research laboratory at JPL and AI applications groups at all NASA centers

AI and OR in management of operations: history and trends

The last decade has seen a considerable growth in the use of Artificial Intelligence (AI) for operations management with the aim of finding solutions to problems that are increasing in complexity and scale. This paper begins by setting the context for the survey through a historical perspective of OR and AI. An extensive survey of applications of AI techniques for operations management, covering a total of over 1200 papers published from 1995 to 2004 is then presented. The survey utilizes Elsevier's ScienceDirect database as a source. Hence, the survey may not cover all the relevant journals but includes a sufficiently wide range of publications to make it representative of the research in the field. The papers are categorized into four areas of operations management: (a) design, (b) scheduling, (c) process planning and control and (d) quality, maintenance and fault diagnosis. Each of the four areas is categorized in terms of the AI techniques used: genetic algorithms, case-based reasoning, knowledge-based systems, fuzzy logic and hybrid techniques. The trends over the last decade are identified, discussed with respect to expected trends and directions for future work suggested

Railway scheduling reduces the expected project makespan.

The Critical Chain Scheduling and Buffer Management (CC/BM) methodology, proposed by Goldratt (1997), introduced the concepts of feeding buffers, project buffers and resource buffers as well as the roadrunner mentality. This last concept, in which activities are started as soon as possible, was introduced in order to speed up projects by taking advantage of predecessors finishing early. Later on, the railway scheduling concept of never starting activities earlier than planned was introduced as a way to increase the stability of the project, typically at the cost of an increase in the expected project makespan. In this paper, we will indicate a realistic situation in which railway scheduling improves both the stability and the expected project makespan over roadrunner scheduling.Railway scheduling; Roadrunner scheduling; Feeding buffer; Priority list; Resource availability;

Multiobjective strategies for New Product Development in the pharmaceutical industry

New Product Development (NPD) constitutes a challenging problem in the pharmaceutical industry, due to the characteristics of the development pipeline. Formally, the NPD problem can be stated as follows: select a set of R&D projects from a pool of candidate projects in order to satisfy several criteria (economic profitability, time to market) while coping with the uncertain nature of the projects. More precisely, the recurrent key issues are to determine the projects to develop once target molecules have been identified, their order and the level of resources to assign. In this context, the proposed approach combines discrete event stochastic simulation (Monte Carlo approach) with multiobjective genetic algorithms (NSGAII type, Non-Sorted Genetic Algorithm II) to optimize the highly combinatorial portfolio management problem. In that context, Genetic Algorithms (GAs) are particularly attractive for treating this kind of problem, due to their ability to directly lead to the so-called Pareto front and to account for the combinatorial aspect. This work is illustrated with a study case involving nine interdependent new product candidates targeting three diseases. An analysis is performed for this test bench on the different pairs of criteria both for the bi- and tricriteria optimization: large portfolios cause resource queues and delays time to launch and are eliminated by the bi- and tricriteria optimization strategy. The optimization strategy is thus interesting to detect the sequence candidates. Time is an important criterion to consider simultaneously with NPV and risk criteria. The order in which drugs are released in the pipeline is of great importance as with scheduling problems

Multiobjective strategies for New Product Development in the pharmaceutical industry

New Product Development (NPD) constitutes a challenging problem in the pharmaceutical industry, due to the characteristics of the development pipeline. Formally, the NPD problem can be stated as follows: select a set of R&D projects from a pool of candidate projects in order to satisfy several criteria (economic profitability, time to market) while coping with the uncertain nature of the projects. More precisely, the recurrent key issues are to determine the projects to develop once target molecules have been identified, their order and the level of resources to assign. In this context, the proposed approach combines discrete event stochastic simulation (Monte Carlo approach) with multiobjective genetic algorithms (NSGAII type, Non-Sorted Genetic Algorithm II) to optimize the highly combinatorial portfolio management problem. In that context, Genetic Algorithms (GAs) are particularly attractive for treating this kind of problem, due to their ability to directly lead to the so-called Pareto front and to account for the combinatorial aspect. This work is illustrated with a study case involving nine interdependent new product candidates targeting three diseases. An analysis is performed for this test bench on the different pairs of criteria both for the bi- and tricriteria optimization: large portfolios cause resource queues and delays time to launch and are eliminated by the bi- and tricriteria optimization strategy. The optimization strategy is thus interesting to detect the sequence candidates. Time is an important criterion to consider simultaneously with NPV and risk criteria. The order in which drugs are released in the pipeline is of great importance as with scheduling problems