检索结果-内蒙古大学图书馆

Variability modelling and balancing of stochastic assembly lines

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2016年第19期54卷 5761-5782页

作者： Pinarbasi, Mehmet Yuzukirmizi, Mustafa Toklu, Bilal Hitit Univ Fac Enginerring Dept Ind Engn Corum Turkey Meliksah Univ Fac Econ & Adm Sci Dept Business Adm Kayseri Turkey Gazi Univ Fac Enginerring Dept Ind Engn Ankara Turkey

In a production flow line with stochastic environment, variability affects the system performance. These stochastic nature of real-world processes have been classified in three types: arrival, service and departure process variability. So far, only service process - or task time - variation has been considered in assembly line (AL) balancing studies. In this study, both service and flow process variations are modelled along with AL balancing problem. The best task assignment to stations is sought to achieve the maximal production. A novel approach which consists of queueing networks and constraint programming (CP) has been developed. Initially, the theoretical base for the usage of queueing models in the evaluation of AL performance has been established. In this context, a diffusion approximation is utilised to evaluate the performance of the line and to model the variability relations between the work stations. Subsequently, CP approach is employed to obtain the optimal task assignments to the stations. To assess the effectiveness of the proposed procedure, the results are compared to simulation. Results show that, the procedure is an effective solution method to measure the performance of stochastic ALs and achieve the optimal balance.

关键词： variability stochastic assembly line balancing queueing networks constraint programming diffusion approximation simulation

来源：评论

学校读者我要写书评

暂无评论

A bi-objective approach for scheduling ground-handling vehicles in airports

引用

COMPUTERS & OPERATIONS RESEARCH 2016年 71卷 34-53页

作者： Padron, Silvia Guimarans, Daniel Jose Ramos, Juan Fitouri-Trabelsi, Salma Univ Autonoma Barcelona Dept Telecommun & Syst Engn C Emprius 2 Barcelona 08202 Spain NICTA Optimisat Res Grp 13 Garden St Eveleigh NSW 2015 Australia ENAC MAIAA 7 Ave Edouard Belin F-31055 Toulouse 04 France ENAC Air Transportat Dept 7 Ave Edouard Belin F-31055 Toulouse 04 France Toulouse Business Sch Ind Org Logist & Technol Dept 20 Blvd Lascrosses F-31058 Toulouse France Amsterdam Univ Appl Sci Aviat Acad Amsterdam Netherlands ISSAT Gabes Rue Omar Ibn Khattab 6029 Gabes Tunisia

In the present paper, we propose a new approach for scheduling ground-handling vehicles, tackling the problem with a global perspective. Preparing an aircraft for its next flight requires a set of interrelated services involving different types of vehicles. Planning decisions concerning each resource affect the scheduling of the other activities and the performance of the other resources. Considering the different operations and vehicles instead of scheduling each resource in isolation allows integrating decisions and contributing to the optimization of the overall ground-handling process. This goal is defined through two objectives: (i) minimizing the waiting time before an operation starts and the total reduction of corresponding time windows and (ii) minimizing the total completion time of the turnarounds. We combine different technologies and techniques to solve the problem efficiently. A new method to address this biobjective optimization problem is also proposed. The approach has been tested using real data from two Spanish airports, thereby obtaining different solutions that represent a trade-off between both objectives. Experimental results permit inferring interesting criteria on how to optimize each resource, considering the effect on other operations. This outcome leads to more robust global solutions and to savings in resources utilization. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Air transportation Ground handling Multi-objective optimization constraint programming Vehicle Routing Problem with Time Windows

来源：评论

学校读者我要写书评

暂无评论

An integrated approach to optimise sugarcane rail operations

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2016年第0期98卷 211-220页

作者： Masoud, Mahmoud Kozan, Erhan Kent, Geoff Liu, Shi Qiang Queensland Univ Technol Fac Sci & Engn 2 George StGPO Box 2434 Brisbane Qld 4001 Australia

In Australia, the railway system plays a vital role in transporting the sugarcane crop from farms to mills. The sugarcane transport system is complex as it routines a daily schedule, which consists of a set of train runs to satisfy the requirements of the mills and harvesters. A constrain programming approach is used to formulate this complicated system. Metaheuristic techniques and constraint programming are hybridised as an efficient solution approach. Thus, a better sugarcane transport scheduling system is achieved to maximise the throughput of sugarcane transport. A numerical investigation is presented and demonstrates that high-quality solutions are obtainable for industry-scale applications in a reasonable time. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Sugarcane transport Train scheduling Job shop scheduling constraint programming Metaheuristics

来源：评论

学校读者我要写书评

暂无评论

Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2016年第2期251卷 640-650页

作者： Gedik, Ridvan Rainwater, Chase Nachtmann, Heather Pohl, Ed A. Univ New Haven Dept Mech & Ind Engn 300 Boston Post Rd West Haven CT 06516 USA Univ Arkansas Dept Ind Engn 4207 Bell Engn Ctr1 Univ Arkansas Fayetteville AR 72701 USA

In this study, we propose constraint programming (CP) model and logic-based Benders algorithms in order to make the best decisions for scheduling non-identical jobs with availability intervals and sequence dependent setup times on unrelated parallel machines in a fixed planning horizon. In this problem, each job has a profit, cost and must be assigned to at most one machine in such a way that total profit is maximized. In addition, the total cost has to be less than or equal to a budget level. Computational tests are performed on a real-life case study prepared in collaboration with the U.S. Army Corps of Engineers (USACE). Our initial investigations show that the pure CP model is very efficient in obtaining good quality feasible solutions but, fails to report the optimal solution for the majority of the problem instances. On the other hand, the two logic-based Benders decomposition algorithms are able to obtain near optimal solutions for 86 instances out of 90 examinees. For the remaining instances, they provide a feasible solution. Further investigations show the high quality of the solutions obtained by the pure CP model. (C) 2015 Elsevier B.V. All rights reserved.

关键词： constraint programming Mixed integer programming Logic-based Benders decomposition Scheduling with job availability intervals Sequence dependent setup times

来源：评论

学校读者我要写书评

暂无评论

Increasing task consolidation efficiency by using more accurate resource estimations

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2016年 56卷 407-420页

作者： Iglesias, Jesus Omana De Cauwer, Milan Mehta, Deepak O'Sullivan, Barry Murphy, Liam Univ Coll Dublin Sch Comp Sci & Informat Performance Engn Lab Lero Dublin 2 Ireland Natl Univ Ireland Univ Coll Cork Insight Ctr Data Analyt Cork Ireland

Cloud providers aim to provide computing services for a wide range of applications, such as web applications, emails, web searches, and map-reduce jobs. These applications are commonly scheduled to run on multi-sites clusters that nowadays are becoming larger and more heterogeneous. A major challenge is to efficiently utilize the cluster's available resources, in particular to maximize overall machine utilization levels while minimizing the application waiting time. We propose a methodology for achieving an efficient utilization of the cluster's resources while providing the users with fast and reliable computing services. The methodology consists of three main modules: (i) a prediction module that forecasts the maximum resource requirement of a task;(ii) a scheduling module that efficiently allocates tasks to machines;and (iii) a monitoring module that tracks the levels of utilization of the machines and tasks, and can evict one or more tasks from the machines for rescheduling if required. There are multiple ways of predicting task requirements, scheduling tasks on machines and evicting task from machines. The decisions made in each module can have significant impact on not only the objective function but also on the efficiency of the decisions made in other components, We therefore study these different combinations and analyze their interaction in order to determine a configuration that meets the objective of the problem. To test our methodology we have developed a simulator and provide a detailed analysis of these interactions between different modules by using a publicly available trace from a large Google cluster (similar to 12,000 machines). Our results show that the impact of more accurate resource estimations for the scheduling of tasks and evicting lower priority tasks in case of over-utilization can lead to an increase in the average utilization of the cluster, a reduction in the number of tasks being evicted, and a reduction in task waiting time. (C) 201

关键词： Online scheduling Cloud computing Forecasting Resource provisioning constraint programming

来源：评论

学校读者我要写书评

暂无评论

A minimal contractor for the polar equation: Application to robot localization

引用

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE 2016年第0期55卷 83-92页

作者： Desrochers, B. Jaulin, L. BCRM Brest Tech Navales Brest Direct Gen Armement F-29240 Brest 9 France ENSTA Bretagne Lab STICC 2 Rue Francois Verny F-29806 Brest France

Contractor programming relies on a catalog on elementary contractors which need to be as efficient as possible. In this paper, we introduce a new theorem that can be used to build minimal contractors consistent with equations, and another new theorem to derive an optimal separator from a minimal contractor. As an application, we focus on the channeling polar constraint associated to the change between Cartesian coordinates and Polar coordinates. We illustrate our method on the localization problem of an actual underwater robot where both range and goniometric measurements of landmarks are collected. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Set theory Interval analysis constraint programming Localization Robotics

来源：评论

学校读者我要写书评

暂无评论

Mixed Integer programming models for job shop scheduling: A computational analysis

引用

COMPUTERS & OPERATIONS RESEARCH 2016年第Sep.期73卷 165-173页

作者： Ku, Wen-Yang Beck, J. Christopher Univ Toronto Dept Mech & Ind Engn 5 Kings Coll Rd Toronto ON M5S 3G8 Canada

In both industry and the research literature, Mixed Integer programming (MIP) is often the default approach for solving scheduling problems. In this paper we present and evaluate four MIP formulations for the classical job shop scheduling problem (JSP). While MIP formulations for the JSP have existed since the 1960s, it appears that comprehensive computational studies have not been performed since then. Due to substantial improvements in MIP technology in recent years, it is of interest to compare the standard JSP models using modern optimization software. We perform a fully crossed empirical study of four MIP models using CPLEX, GUROBI and SCIP, focusing on both the number of instances that can be proved optimal and the solution quality over time. Our results demonstrate that modern MIP solvers are able to prove optimality for moderate-sized problems very quickly. Comparing the four MIP models, the disjunctive formulation proposed by Manne performs best on both performance measures. We also investigate the performance of MIP with multi-threading and parameter tuning using CPLEX. Noticeable performance gain is observed when compared to the results using only single thread and default parameter settings. Our results serve as a snapshot of the performance of modern MIP solvers for an important, well-studied scheduling problem. Finally, the results of MW is compared to constraint programming (CP), another common approach for scheduling, and the best known complete algorithm to provide a broad view among different approaches. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Job shop scheduling Mixed Integer programming constraint programming

来源：评论

学校读者我要写书评

暂无评论

Visual search tree profiling

引用

constraintS 2016年第1期21卷 77-94页

作者： Shishmarev, Maxim Mears, Christopher Tack, Guido de la Banda, Maria Garcia Monash Univ Fac IT Melbourne Vic 3004 Australia Natl ICT Australia NICTA Victoria Melbourne Vic Australia

Understanding how the search space is explored for a given constraint problem - and how it changes for different models, solvers or search strategies - is crucial for efficient solving. Yet programmers often have to rely on the crude aggregate measures of the search that are provided by solvers, or on visualisation tools that can show the search tree, but do not offer sophisticated ways to navigate and analyse it, particularly for large trees. We present an architecture for profiling a constraint programming search that is based on a lightweight instrumentation of the solver. The architecture combines a visualisation of the search tree with various tools for convenient navigation and analysis of the search. These include identifying repeated subtrees, high-level abstraction and navigation of the tree, and the comparison of two search trees. The resulting system is akin to a traditional program profiler, which helps the user to focus on the parts of the execution where an improvement to their program would have the greatest effect.

关键词： constraint programming Search tree Profiling Comparison Visualisation

来源：评论

学校读者我要写书评

暂无评论

Operating room management under uncertainty

引用

constraintS 2016年第4期21卷 577-596页

作者： Gauthier, Jean Bertrand Legrain, Antoine Gerad 3000 Chemin Cote St Catherine Montreal PQ H3T 2A7 Canada HEC Montreal 3000 Chemin Cote St Catherine Montreal PQ H3T 2A7 Canada CIRRELT 2500 Chemin Polytech Montreal PQ H3T 1J4 Canada Polytech Montreal 2500 Chemin Polytech Montreal PQ H3T 1J4 Canada

The operating room management problems are legion. This paper tackles the scheduling of surgical procedures in an operating theatre containing up to two operating rooms and two surgeons. We first solve a deterministic version that uses the constraint programming paradigm and then a stochastic version which embeds the former in a sample average approximation scheme. The latter produces more robust schedules that cope better with the surgeries' time variability.

关键词： Operating room management Uncertainty Stochastic constraint programming Sample average approximation

来源：评论

学校读者我要写书评

暂无评论

Scheduling operating rooms with consideration of all resources, post anesthesia beds and emergency surgeries

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2016年 97卷 248-257页

作者： Latorre-Nunez, Guillermo Lueer-Villagra, Armin Marianov, Vladimir Obreque, Carlos Ramis, Francisco Neriz, Liliana Pontificia Univ Catolica Chile Dept Elect Engn Santiago Chile Univ Bio Bio Dept Ind Engn Concepcion Chile Univ Chile Dept Management & Informat Syst Santiago Chile Univ Andres Bello Dept Engn Sci Santiago Chile

Surgery rooms are among the most expensive resources in hospitals and clinics. Their scheduling is difficult because, in addition to the surgical room itself, each surgery requires a particular combination of human resources, as well as different pieces of equipment and materials. Furthermore, after each surgery, a post-anesthesia bed is required for the patient to recover. Finally, in addition to planned surgeries, the scheduling must be made in such a way as to accommodate the emergency surgeries that may arrive during each day, which, must be attended within a limited time. We address the surgery scheduling problem considering simultaneously, for the first time, the operating rooms, the post anesthesia recovery, the resources required by the surgery and the possible arrival of emergency surgeries. We propose an integer linear programming model that allows finding optimal solutions for small size instances, we transform it to use constraint programming, and develop a metaheuristic based on a genetic algorithm and a constructive heuristic, that solves larger size instances. Finally, we present numerical experiments. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Operating room scheduling Emergency surgeries Hybrid flow shop constraint programming Genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：