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

IEEE Power and Energy Society General Meeting

作者： Bokan Chen Leilei Zhang Yanyi He Department of Industrial and Manufacturing Systems Engineering Iowa State University NEC lab

ISBN: (纸本)9781467380416

Demand side management has attracted a lot of attention as a method to regulate customer behavior and improve system reliability. In this paper, we solve the day-ahead energy pricing problem in the distribution electricity system by taking into account the fact that customers can change their consumption behavior in response to price changes. We propose two pricing models under two different scenarios. In the first scenario, customers' consumption profiles at different prices are available data. We propose an integer programming model to maximize the revenue of the utility company. In the second scenario, we assume only the consumption profiles at the current price, which is static, are available. A game theoretic bilevel optimization model is built to describe the relationship between electricity price and customers' behavior. We then compare and analyze the results of the two models.

关键词： Dynamic energy pricing Demand response integer programming Bilevel optimization Data-driven decision making Demand-Responsive integer programming Pricing Energy costs Prices Purchasing customers integer programming models data driven Consumer Behavior Tuberculosis

来源：评论

学校读者我要写书评

暂无评论

Research on Scheduling Problem of Single-Arm Cluster Tools with Residency Time Constraints

Research on Scheduling Problem of Single-Arm Cluster Tools w...

引用

IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems

作者： Rui Lu Police Information Department Liaoning Police College

ISBN: (纸本)9781479987313

This paper considers the scheduling model and schedulability for single-arm cluster tools with wafer residency time constraints, and constructs a mixed integer programming model with the temporal constraints of both single-arm robot and processing module. The rationality of equivalent processing time for parallel module was theoretically proved. Based on this, the periodic wafer processing and transportation procedure for both single arm robot and processing module is analyzed. Meanwhile, the schedulability conditions for cluster tools are proved. The simulation experiments are carried out to test the model and schedulable conditions, the results reveal the validity and feasibility of the presented model.

关键词： Semiconductor manufacutory Cluster tools Residency time cosntraints Single-arm robot Schedulability analysis cluster tools Time constraints simulation test scheduling model integer programming models Residency

来源：评论

学校读者我要写书评

暂无评论

Selective Hearing: An Approach to Distributed, Eventually Consistent Edge Computation

Selective Hearing: An Approach to Distributed, Eventually Co...

引用

IEEE International Symposium on Reliable Distributed Systems Workshop

作者： Christopher Meiklejohn Peter Van Roy Basho Technologies Inc. Universite catholique de Louvain

ISBN: (纸本)9781509000937

We present a new programming model for large-scale mobile and "Internet of Things" style distributed applications. The model consists of two layers: a language layer based on the Lasp language with a runtime layer based on epidemic broadcast. The Lasp layer provides deterministic coordination-free computation primitives based on conflict-free replicated data types (CRDTs). The epidemic broadcast layer is based on the Plumtree protocol. It provides a communication framework where clients may only have a partial view of membership and may not want to participate in or have knowledge of all active computations. We motivate the new model with a nontrivial mobile application, a distributed ad counter, and we give the model's formal semantics.

关键词： local view Distribute arithmetic customers Internet of things Thing Epidemic Hearing linear programming models integer programming models Language Mobile Applications data types

来源：评论

学校读者我要写书评

暂无评论

Time-Space Network Based Exact models for Periodical Monitoring Routing Problem

Time-Space Network Based Exact Models for Periodical Monitor...

引用

American Control Conference

作者： Muhong Zhang Derek Kingston School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe AZ 85287 USA Wright Patterson Air Force Base Vehicles Division 2210 8th St. B20146 R301 Wright Patterson OH 45433

ISBN: (纸本)9781479917730

Unmanned Air Vehicles (UAVs) have been used cooperatively with Unattended Ground Sensors (UGSs) to monitor and identify intruders on a road network system. The current practice includes four phases. In the patrol phase, UAVs visits UGSs periodically to detect the possible alarms. Once an alarm is detected, the second isolation phase is activated to determine the region of the intruders on the network. Delivery/classification and response are the two following phases, which need more human involvements. This work focuses on the first patrol phase to determine the optimal patrol route visiting the UGSs periodically with minimal weighted revisit time interval. Since the objective focuses on a single UGS with worst performance (longest revisit time) and there are large number of alternative optimal solutions, a secondary objective is considered to minimize the duration of the total reiterative tour. Two mixed integer programming models are considered on a time-space discretized network. Numerical experiments show the nontrivial solutions on a small network. The second model improves the computational performance from the first model. The quality of the solutions are evaluated by upper and lower bounds.

关键词： Routing Problem revisit time Unmanned Aerial Vehicle Alarm Phase Intruder computational performance Lower bound Unattended Ground Sensor integer programming models

来源：评论

学校读者我要写书评

暂无评论

ITERATIVE SIMULATION AND OPTIMIZATION APPROACH FOR JOB SHOP SCHEDULING

ITERATIVE SIMULATION AND OPTIMIZATION APPROACH FOR JOB SHOP ...

引用

Winter Simulation Conference

作者： Kulkarni, Ketki Venkateswaran, Jayendran Indian Inst Technol Ind Engn & Operat Res Room 308A Mech Engn Bldg Mumbai 400076 Maharashtra India

ISBN: (纸本)9781479974863

In this paper, we present an iterative scheme integrating simulation with an optimization model, for solving complex problems, viz., job shop scheduling. The classical job shop scheduling problem which is NP-Hard, has often been modelled as Mixed-integer programming (MIP) model and solved using exact algorithms (for example, branch-and-bound and branch-and-cut) or using meta-heuristics (for example, Genetic Algorithm, Particle Swarm Optimization and Simulated Annealing). In the proposed Iterative Simulation-Optimization (ISO)approach, we use a modified formulation of the scheduling problem where the operational aspects of the job shop are captured only in the simulation model. Two new decision variables, controller delays and queue priorities are used to introduce feedback constraints, that help exchange information between the two models. The proposed method is tested using benchmark instances from the OR library. The results indicate that the method gives near optimal schedules in a reasonable computational time.

关键词： computational complexity integer programming iterative methods job shop scheduling ISO approach MIP model NP-hard problem controller delay decision variables exact algorithms feedback constraints iterative simulation-optimization approach job shop scheduling problem meta-heuristics mixed-integer programming model queue priority simulation model Analytical models Computational modeling Job shop scheduling Linear programming Mathematical model Optimization Schedules Job shop scheduling Nondeterministic polynomial-time hard Computational modeling ANALYSIS models iterative methods integer programming Simulation models linear programming complexity classes Mathematical Model integer programming models

来源：评论

学校读者我要写书评

暂无评论

A Middleware for Managing Non-Functional Requirements in Cloud PaaS

A Middleware for Managing Non-Functional Requirements in Clo...

引用

International Conference on Cloud and Autonomic Computing (ICCAC)

作者： Braubach, Lars Jander, Kai Pokahr, Alexander Univ Hamburg Dept Comp Sci Distributed Syst Grp Hamburg Germany

ISBN: (纸本)9781479958412

A key aspect of distributed applications in platformas-a-service clouds revolves around the definition of requirements for quality of service and the most efficient use of the available resources to achieve them. Matching both the requirements and resources represents a unique challenge: While requirements are generally defined in relatively abstract form and defined as system-wide parameters, the resources are concrete, low-level entities that, by themselves, are only of marginal influence on the requirements. In order to establish a relationship between these two requires both the agglomeration of properties into more abstract ones as well as refining requirements in more detailed, concrete ones, both of which can often only be done to a certain degree. This paper presents a vision how both aspects can be brought to the same level and introduces an approach enhancing component-based cloud applications with non-functional properties in the context of an integrated programming model. This allows developers of such applications to formally declare properties that may influence the application during runtime and document the expectations regarding non-functional aspects of the overall system. This can be used to ensure the health of the application and, in case requirements are violated, actions like the deployment of additional resources can be performed in order to alleviate any degradation of its non-functional state, either by evaluating, choosing and performing pre-defined actions automatically or by manual administrative intervention.

关键词： cloud computing middleware object-oriented programming administrative intervention cloud PaaS component-based cloud applications integrated programming model nonfunctional properties nonfunctional requirements platform-as-a-service clouds Concrete Current measurement Middleware Monitoring programming Quality of service Runtime cloud applications components platform-as-a-service programming model Middleware Cloud Computing Runtime Quality of service Electric current measurement Current measuring object oriented programming programming Concrete linear programming models integer programming models

来源：评论

学校读者我要写书评

暂无评论

Interactive Depth First Algorithm for Oil Transportation Emergency Response Planning 14

Interactive Depth First Algorithm for Oil Transportation Eme...

引用

Simulation Multiconference

作者： Victor Romanov Ilya Moskovoy Kseniya Grigoryeva Russian Plekhanov University Information Systems in Economics and Management Department

ISBN: (纸本)9781632667335

In the event of an oil spill, an essential element of responding effectively to any adverse consequences is proper planning to define tasks, personnel, and resources necessary. The plan should include coordination with appropriate local, municipal, territorial, regional and federal departments, and include ground and air transportation, logistics support, spill reagent supply and repair equipment delivery. The task of automated planning-based on the concepts and principles of Artificial Intelligence (AI)-has become more urgent due to a dramatic rise in oil leak events. The idea of automated planning is not new. It is based on 50 years of research in the field, including predicate logic, situational calculus, dynamic and integer programming models STRIPS [19], PDDL [22] languages apply. The challenge is especially urgent for the petroleum and gas sectors of the Russian economy as the number of oil leaks has spiked to 28 thousand per year.

关键词： Automated planning Oil spill Pipeline rupture Interactive algorithm Restoring plans Situation calculus Depth first search Depth--first search oil spill hazard preparedness Petroleum Transportation integer programming models

来源：评论

学校读者我要写书评

暂无评论

Scheduling the professional Ecuadorian football league by integer programming

引用

COMPUTERS & OPERATIONS RESEARCH 2013年第10期40卷 2478-2484页

作者： Recalde, D. Torres, R. Vaca, P. Escuela Politec Nacl Dept Math Quito Ecuador

A sports schedule sets the dates and venues of games among teams in a sports league. Constructing a sports schedule is a highly restrictive problem. The schedule must meet constraints due to regulations of a particular sports league federation and it must guarantee the participation of all teams on equal terms. Moreover, economic benefits of the teams and other agents involved in this activity are expected. Until 2011, the Ecuadorian football federation (FEF) had developed schedules for their professional football championship manually. In early 2011, the authors presented to the FEF authorities evidence that the use of mathematical programming to create feasible sports schedules could easily exceed the benefits obtained by the empirical method. Under this premise, this work presents an integer programming formulation, solved to optimality, for scheduling the professional football league in Ecuador, and also a heuristic approach based on three-phases for its solution. The schedules obtained met the expectations of the FEF and one of them was adopted as the official schedule for the 2012 edition of the Ecuadorian professional football championship. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： Sports scheduling integer programming models Football

来源：评论

学校读者我要写书评

暂无评论

Mathematical programming models for Scheduling in a CPU/FPGA Architecture with Communication Delay

Mathematical Programming Models for Scheduling in a CPU/FPGA...

引用

5th International Conference on Industrial Engineering and Systems Management (IEEE IESM)

作者： El Cadi, Abdessamad Ait Ben Atitallah, Rabie Artiba, Abdelhakim UVHC LAMIH UMR 8201 F-59313 Valenciennes 9 France

ISBN: (纸本)9782960053241

This paper deals with the mathematical modelling of a scheduling problem in a heterogeneous CPU/FPGA architecture with communication delay in order to minimize the makespan, C-max. This study was motivated by the quality of the available solvers for Mixed integer Program. The proposed model includes the communication delay constraints in a general form in a heterogeneous case depending at the same time on tasks and computing units. These constraints are linearized without adding any extra variables and the obtained linear model is reduced to make its solving with Cplex 12.5x faster. Computational results show that the proposed model is promising. For an average sized problem up to 50 tasks and 5 computing units the solving time under Cplex is about few seconds.

关键词： Mixed integer Communication Research Religious Missions Optimization methods mathematical programming ARCHITECTURE Building construction linear programming models integer programming models mathematical modeling linear models delay

来源：评论

学校读者我要写书评

暂无评论

integer programming Approach for a Class of Staff Scheduling Problems - Schedule Optimization and Parameter Estimation

Integer Programming Approach for a Class of Staff Scheduling...

引用

6th International Conference on Soft Computing and Intelligent Systems (SCIS) / 13th International Symposium on Advanced Intelligence Systems (ISIS)

作者： Ohara, Makoto Tamaki, Hisashi Kobe Univ Grad Sch Law Nada Ku Rokko Dai 2-1 Kobe Hyogo 6578501 Japan Kobe Univ Grad Sch Syst Informat Nada Ku Kobe Hyogo 6578501 Japan

ISBN: (纸本)9781467327435;9781467327428

This paper introduces an integer programming approach for a class of staff scheduling problems which is applicable for various kinds of the problems by both adopting an optimization model and parameter estimation techniques based on a mathematical programming formulation. For a work in which a staff must change or rotate shifts, generally, a responsible personnel (e.g., a manager) makes a schedule (e.g., a dairy or a weekly staff assignment) in a manual way based on some experiences. It is very hard, however, to generate not only a good schedule but also a feasible one, due to several kinds of constraints and requirements should be satisfied. Here, it is the case that the constraints are not be completely clear because these have no evident boundary, which makes the scheduling problems more difficult. In this paper, first, the staff scheduling problem is formally described in a rather generalized form to apply a wide range of work types, and is formulated as a integer programming model. In this formulation, so many parameters concerning the desires of workers as well as the conditions on works are included. Then, some ways of identifying the parameters is investigated by utilizing the available information acquired extraction from the past staff schedules and listening from managers. In the case that the setting of the parameters is not suitable, a good schedule or even a practical schedule can not be obtained through the integer programming model. With respect to this point, some computational examples have been done in order to examine the reliability of the way of setting parameters as well as the model of optimizing schedule. Through the result of computational examples, the effectiveness and the potential of the proposed approach are confirmed.

关键词： staff integer programming models Parameter estimation integer programming manager Personnel

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：