International Conference on Operations Research and Enterprise Systems最新文献_第3页

A Simulation-based Optimisation Approach for Inventory Management of Highly Perishable Food 基于仿真的易腐食品库存管理优化方法

International Conference on Operations Research and Enterprise Systems Pub Date : 2019-02-19 DOI: 10.5220/0007401304060413

Ning Xue, Dario Landa Silva, G. Figueredo, I. Triguero

{"title":"A Simulation-based Optimisation Approach for Inventory Management of Highly Perishable Food","authors":"Ning Xue, Dario Landa Silva, G. Figueredo, I. Triguero","doi":"10.5220/0007401304060413","DOIUrl":"https://doi.org/10.5220/0007401304060413","url":null,"abstract":"The taste and freshness of perishable foods decrease dramatically with time. Effective inventory management requires understanding of market demand as well as balancing customers needs and references with products’ shelf life. The objective is to avoid food overproduction as this leads to waste and value loss. In addition, product depletion has to be minimised, as it can result in customers reneging. This study tackles the production planning of highly perishable foods (such as freshly prepared dishes, sandwiches and desserts with shelf life varying from 6 to 12 hours), in an environment with highly variable customers demand. In the scenario considered here, the planning horizon is longer than the products’ shelf life. Therefore, food needs to be replenished several times at different intervals. Furthermore, customers demand varies significantly during the planning period. We tackle the problem by combining discrete-event simulation and particle swarm optimisation (PSO). The simulation model focuses on the behaviour of the system as parameters (i.e. replenishment time and quantity) change. PSO is employed to determine the best combination of parameter values for the simulations. The effectiveness of the proposed approach is applied to some real-world scenario corresponding to a local food shop. Experimental results show that the proposed methodology combining discrete event simulation and particle swarm optimisation is effective for inventory management of highly perishable foods with variable customers demand.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121585994","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Scheduling on Dedicated Machines with Energy Consumption Limit 具有能耗限制的专用机器调度

International Conference on Operations Research and Enterprise Systems Pub Date : 2019-02-19 DOI: 10.5220/0007307200530062

I. Módos, Kiryl Kalodkin, P. Šůcha, Z. Hanzálek

{"title":"Scheduling on Dedicated Machines with Energy Consumption Limit","authors":"I. Módos, Kiryl Kalodkin, P. Šůcha, Z. Hanzálek","doi":"10.5220/0007307200530062","DOIUrl":"https://doi.org/10.5220/0007307200530062","url":null,"abstract":"This work studies a problem of scheduling non-preemptive independent jobs on dedicated machines while considering an energy consumption limit. The problem is motivated by energy-demanding production processes, such as glass tempering and steel hardening, in which a material is heated to high temperature in furnaces. The production companies have contracts with electric utilities that specify a maximum energy consumption limit. If the heating in the furnaces is not planned carefully, the energy spikes overshoot the energy consumption limit, and the companies must pay large penalty fees. In this paper, we propose two exact methods that find schedules with the minimum makespan such that the energy limit is satisfied. The first proposed method is a Constraint Programming model and the second one finds the optimal solution by iteratively re-solving a Mixed Integer Linear Programming model with a decreasing scheduling horizon. The iterative algorithm exploits the fact that the start times do not need to be modeled explicitly, which leads to an efficient method for solving instances with a higher number of shorter jobs. The experimental results show that our methods outperform an adapted approach from the literature for a related problem.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123854344","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Simulation of Vehicle Movements for Planning Construction Logistics Centres 规划建设物流中心的车辆运动模拟

International Conference on Operations Research and Enterprise Systems Pub Date : 2019-02-19 DOI: 10.5220/0007346802580263

F. Ying, M. J. O'Sullivan, I. Adan

{"title":"Simulation of Vehicle Movements for Planning Construction Logistics Centres","authors":"F. Ying, M. J. O'Sullivan, I. Adan","doi":"10.5220/0007346802580263","DOIUrl":"https://doi.org/10.5220/0007346802580263","url":null,"abstract":"Purpose\u0000Materials supply is one of the important elements in construction operation and a major factor affecting the quality of construction projects. Many industries look to manage materials effectively by attempting to integrate logistics processes into logistics chains of suppliers and customers. Logistics processes, being crucial for successful completion of construction projects, but in fact, auxiliary, are often entrusted to external professionals specialised in logistic services, such as logistics centres. However, this tendency is yet to be developed in construction. The purpose of this paper is to develop a simulation framework for the examination of potential improvements of logistics performance using logistics centres.\u0000\u0000\u0000Design/methodology/approach\u0000A case study approach was adopted with computer simulation using Flexsim. Data of vehicle movements were collected during construction on-site from the start of construction to “hand-over” to the building owner.\u0000\u0000\u0000Findings\u0000The ideal location of a logistics centre is identified using vehicle movements data collected on the site. The potential improvements of the planned centre are then evaluated by simulating various scenarios of vehicle movements. The enclosed results from the simulations indicate that using a logistics centre will reduce waste for the construction project considered.\u0000\u0000\u0000Originality/value\u0000The paper emphasises that creating a logistics centre for a project can improve construction logistics performance, by consolidating and optimizing both off-site and on-site logistics, especially when the site condition is prohibitive (small footprint with limited loading bay area). Establishing logistics centres may help find ways of making the overall construction project more effective by improving the management of materials.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124466348","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Efficient Imputation Method for Missing Data Focusing on Local Space Formed by Hyper-Rectangle Descriptors 基于超矩形描述子构成的局部空间缺失数据的高效补全方法

International Conference on Operations Research and Enterprise Systems Pub Date : 2019-02-19 DOI: 10.5220/0007582104670472

Do Gyun Kim, J. Choi

引用次数: 0

Smart City Development: A Business Process-centric Conceptualisation 智慧城市发展:以业务流程为中心的概念

International Conference on Operations Research and Enterprise Systems Pub Date : 2019-02-19 DOI: 10.5220/0007382203460353

Vahid Javidroozi, Hanifa Shah, Gerald Feldman

引用次数: 1

Container Yard Allocation under Uncertainty 不确定条件下的集装箱堆场配置

International Conference on Operations Research and Enterprise Systems Pub Date : 2019-02-19 DOI: 10.5220/0007253700300036

Yue Wu

引用次数: 0

Makespan Minimization with Sequence-dependent Non-overlapping Setups 与序列相关的非重叠设置的最大跨度最小化

International Conference on Operations Research and Enterprise Systems Pub Date : 2019-02-19 DOI: 10.5220/0007362700910101

M. Vlk, A. Novák, Z. Hanzálek

{"title":"Makespan Minimization with Sequence-dependent Non-overlapping Setups","authors":"M. Vlk, A. Novák, Z. Hanzálek","doi":"10.5220/0007362700910101","DOIUrl":"https://doi.org/10.5220/0007362700910101","url":null,"abstract":"This paper deals with a scheduling problem that emerges in the production of water tubes of different sizes that require reconfiguration of the machines. The reconfiguration of the machines leads to the notion of sequence-dependent setup times between tasks. These setups are often performed by a single person who cannot serve more than one machine at the same moment, i.e., the setups must not overlap. Surprisingly, the problem with non-overlapping setups has received only a little attention so far. To solve this problem, we propose an Integer Linear Programming formulation, Constraint Programming models and a hybrid heuristic that leverages the strength of Integer Linear Programming in the shortest Hamiltonian path problem and the efficiency of Constraint Programming at sequencing problems with makespan minimization. The experimental evaluation shows that among the proposed exact approaches, the Constraint Programming is a superior method being able to solve instances with 3 machines and up to 11 tasks on each machine to optimality within a few seconds. The proposed hybrid heuristic attains high-quality solutions for instances with 50 machines and up to 116 tasks on each machine.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123287400","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

The Capacitated Lot Sizing Problem with Batch Ordering: A MILP and Heuristic Approach 批量排序的有容量批量问题:一种MILP和启发式方法

International Conference on Operations Research and Enterprise Systems Pub Date : 2019-02-19 DOI: 10.5220/0007297402290236

Gustavo Macedo-Barragán, Samuel Nucamendi-Guillén, E. O. Benítez, Omar G. Rojas

{"title":"The Capacitated Lot Sizing Problem with Batch Ordering: A MILP and Heuristic Approach","authors":"Gustavo Macedo-Barragán, Samuel Nucamendi-Guillén, E. O. Benítez, Omar G. Rojas","doi":"10.5220/0007297402290236","DOIUrl":"https://doi.org/10.5220/0007297402290236","url":null,"abstract":"This article presents a mixed integer linear programming method and a heuristic algorithm to deal with the problem of multi-period, multiple-product batch purchases, with a finite time horizon, considering delivery times, order placement costs and independent batch size for each product. The objective of this problem is to minimize the costs of placing purchase orders and inventory. This problem is motivated by its application in a marketing company that handles the sale of fashion products (footwear and accessories) through catalogs and for which excess inventory represents a major problem given the short life cycle of its products. Experimental results show that the heuristic algorithm is able to obtain feasible solutions that improve in cost by up to 37% the best integer solutions reported by the model when it reaches the time limit. To validate the efficiency of the algorithm, a real scenario was solved for a trading company, obtaining results that improve by 28% compared to the current company’s situation. These results show that the heuristic approach is promising in terms of the quality of the solution and the computational time required.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125908559","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Using Phase-type Models to Monitor and Predict Process Target Compliance 使用阶段型模型监控和预测过程目标符合性

International Conference on Operations Research and Enterprise Systems Pub Date : 2019-02-19 DOI: 10.5220/0007362200820090

S. McClean, D. Stanford, L. Garg, Naveed Khan

{"title":"Using Phase-type Models to Monitor and Predict Process Target Compliance","authors":"S. McClean, D. Stanford, L. Garg, Naveed Khan","doi":"10.5220/0007362200820090","DOIUrl":"https://doi.org/10.5220/0007362200820090","url":null,"abstract":"Processes are ubiquitous, spanning diverse areas such as business, production, telecommunications and healthcare. They have been studied and modelled for many years in an attempt to increase understanding, improve efficiency and predict future pathways, events and outcomes. More recently, process mining has emerged with the intention of discovering, monitoring, and improving processes, typically using data extracted from event logs. This may include discovering the tasks within the overall processes, predicting future trajectories, or identifying anomalous tasks. We focus on using phase-type process modelling to measure compliance with known targets and, inversely, determine suitable targets given a threshold percentage required for satisfactory performance. We illustrate the ideas with an application to a stroke patient care process, where there are multiple outcomes for patients, namely discharge to normal residence, nursing home, or death. Various scenarios are explored, with a focus on determining compliance with given targets; such KPIs are commonly used in Healthcare as well as for Business and Industrial processes. We believe that this approach has considerable potential to be extended to include more detailed and explicit models that allow us to assess complex scenarios. Phase-type models have an important role in this work.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129227978","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Risk Analysis of Distributed Generation Scenarios 分布式发电场景风险分析

International Conference on Operations Research and Enterprise Systems Pub Date : 2019-02-19 DOI: 10.5220/0007389203780383

P. Maçaira, Margarete Afonso de Sousa, R. Souza, F. C. Oliveira

引用次数: 0