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

IEEE International Conference on Industrial Technology (ICIT)

作者： Steneberg, Steffen C. Hamburg Univ Technol Inst Automat Hamburg Germany

ISBN: (纸本)9781467345675;9781467345682

This paper addresses the cyclic multi-hoist scheduling problem. The problem arises in automated electroplating lines where multiple hoists are operating on a shared track. A number of parts are processed periodically and are categorized in different types of products. For each type of product a different processing sequence and processing time windows are supported. All parts of the same product are identical. A different number of parts for each product within a cycle is possible. The general processing sequences may be different from the location sequence of the tanks and multi functional resources are considered. A multi-degree cyclic mixed integer linear programming (MILP) model for optimizing the cycle time is presented, considering in particular the spacial dimensions of hoists and their collision. There are no restrictions concerning the start and end of loaded or empty hoist moves. The collision avoidance is formulated with the help of spacial relations of the movement. The model supports fixed and processing times with time windows.

关键词： Robotic Cycle Shop Multi Hoist Scheduling Spacial Relations mixed integer linear programming MILP Multi Part Multi Product Multi Functional Resources

来源：评论

学校读者我要写书评

暂无评论

Optimal Mapping of Multiple Packet Lookup Schemes onto FPGA

Optimal Mapping of Multiple Packet Lookup Schemes onto FPGA

引用

International Conference on Reconfigurable Computing and FPGAs (ReConFig)

作者： Haria, Swapnil Prasanna, Viktor Birla Inst Technol & Sci Pilani Rajasthan India Univ So Calif Dept Elect Engn Los Angeles CA 90089 USA

ISBN: (纸本)9781479920785

Nowadays, Ethernet/IP based packet forwarding consists of a complex set of lookup schemes. A router/switch may have to support multiple such lookup schemes, depending on the location and specific operation of the device. Manual conversion of lookup schemes into a target architecture is slow and does not ensure an optimal allocation of FPGA resources for best performance. We develop an integer linear programming (ILP) model for the problem of mapping complex lookup schemes onto FPGA while minimizing packet latency. The developed model is extended to provide support for both throughput-optimized and power-aware mapping. In all the cases, our formulation leads to optimal solution. We provide abstractions for representing lookup schemes and their corresponding implementation choices, and also for the FPGA devices and their power consumption. These abstractions simplify the description of lookup schemes, while preserving the necessary details, and thus reduce the solution time. We demonstrate the practicality of the developed model by optimally mapping several complex real world lookup schemes onto a state-of-the-art FPGA device using a popular ILP solver package. In all the cases, the execution time on a desktop workstation is under a minute.

关键词： IP lookup FPGA Architecture mapping mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

An MPC Scheme for Routing Problem in Baggage Handling Systems: A linear programming Approach

An MPC Scheme for Routing Problem in Baggage Handling System...

引用

10th IEEE International Conference on Networking, Sensing and Control (ICNSC)

作者： Zeinaly, Yashar De Schutter, Bart Hellendoorn, Hans Delft Univ Technol Delft Ctr Syst & Control Delft Netherlands

ISBN: (纸本)9781467352000;9781467351980

This paper considers the routing problem of DCVs in state-of-the-art baggage handling systems. In previous work, this problem was considered within the framework of model predictive control, where the optimization problem was recast as a mixed integer linear programming problem. We make two significant improvements with respect to this previous work. We show that by choosing an alternative model, the optimization problem can be recast as a linear programming problem, which has significant computational advantages. Furthermore, we use a new cost function that reflects the control objectives in a better way. This leads to a computationally efficient routing controller.

关键词： Routing Problem mixed integer linear programming linear programming Maximum Allowable Concentration

来源：评论

学校读者我要写书评

暂无评论

A Stochastic MILP Model for Long-term Hydrothermal Scheduling Considering Water Resource Management

A Stochastic MILP Model for Long-term Hydrothermal Schedulin...

引用

第三十二届中国控制会议

作者： TONG Bo ZHAI Qiaozhu GUAN Xiaohong Systems Engineering Institute and MOE KLINNS Lab Xi'an Jiaotong University

ISBN: (纸本)9789881563835

A multistage scenario tree based stochastic model is proposed for long-term hydrothermal scheduling(LHTS) in this paper to hedge against the uncertainties of natural inflows,water demand,grid load and wind power *** scenarios reduction,a 3-stage,81-scenario stochastic tree is established based on stochastic weather condition and net *** addition, detailed formulations of hydrothermal system and water resource management such as water supply/recession procedure, distributed water usage allocation policy and *** also included in the basic nonlinear *** the nonlinear functions in the formulation such as thermal generating costs function,hydro power production function,water recession function and reservoir evaporation function are replaced by their piecewise linear equivalents and the stochastic mixed integer linear programming(MILP) formulation is solved by commercial solver *** numerical results show that the proposed stochastic MILP model for LHTS is efficient.

关键词： Stochastic programming long-term hydrothermal scheduling water resource management mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A tight MILP formulation based on multi-product valid inequalities for a lot-sizing problem

A tight MILP formulation based on multi-product valid inequa...

引用

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

作者： Gicquel, Celine Minoux, Michel Univ Paris 11 Lab Rech Informat F-91405 Orsay France Univ Paris 06 Lab Informat Paris 6 F-75005 Paris France

ISBN: (纸本)9782960053241

We consider a problem arising in the context of industrial production planning, namely the multi-product discrete lot-sizing and scheduling problem with sequence-dependent changeover costs. We aim at developping an exact solution approach based on a standard Branch & Bound procedure for this combinatorial optimization problem. To achieve this, we propose a new family of multi-product valid inequalities which enables us to better take into account in the mixed integer linear programming formulation the conflicts between different products simultaneously requiring production on the resource. We then present both an exact and a heuristic separation algorithm in order to identify the most violated valid inequalities to be added in the initial MILP formulation within a cutting-plane generation algorithm. We finally discuss preliminary computational results which confirm the practical usefulness of the proposed valid inequalities at strengthening the MILP formulation and at reducing the overall computation time.

关键词： inequalities Valid computational time Exact industrial production New families mixed integer linear programming lot sizing

来源：评论

学校读者我要写书评

暂无评论

Batch versus cyclic scheduling of flexible flow shops by mixed-integer programming

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2012年第18期50卷 5017-5034页

作者： Sawik, Tadeusz AGH Univ Sci & Technol Dept Operat Res & Informat Technol PL-30059 Krakow Poland

New mixed-integer programming models are proposed for deterministic batch or cyclic scheduling in flow shops with parallel machines and finite in-process buffers. Models for scheduling with all machines continuously available for processing throughout the entire scheduling horizon as well as for scheduling with an arbitrary pattern of machine availability due to pre-scheduled downtime events are provided. Numerical examples modelled after real-world flexible flow shop scheduling in electronics manufacturing are presented, and to compare the batch and cyclic schedules with continuous or with limited machine availability, results of computational experiments are reported.

关键词： flow shop scheduling mixed integer linear programming batch scheduling cyclic scheduling

来源：评论

学校读者我要写书评

暂无评论

Demand Response and Energy Storage in MV Islanded Microgrids for High Penetration of Renewables

Demand Response and Energy Storage in MV Islanded Microgrids...

引用

IEEE Electrical Power and Energy Conference (EPEC)

作者： Alharbi, Walied Bhattacharya, Kankar Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada

ISBN: (纸本)9781479901067

Demand response (DR) and energy storage (ES) have the potential to support high levels of renewable energy (RE) penetration than currently possible, by providing such flexibility in power system operations. This paper presents optimal energy management in islanded microgrids using DR mechanisms and ES system, for enabling secure microgrids with high penetration of renewables. The potential for achieving higher penetration in islanded microgrids is also investigated. A mathematical model is developed for the islanded mode operation of a microgrid. The optimization is formulated as a mixed integer linear programming (MILP) problem, which is solved using the CPLEX solver in the General Algebraic Modeling System (GAMS) platform. A case study is carried out to illustrate the usefulness of the proposed model. The numerical results show the effectiveness of the coordinated operation of ES with DR on operational costs, and RE penetration levels.

关键词： Demand response energy storage mixed integer linear programming renewable energy microgrids

来源：评论

学校读者我要写书评

暂无评论

Lagrangian Relaxation Approach for Low Complexity Channel Assignment in Multi-Cell WLANS

Lagrangian Relaxation Approach for Low Complexity Channel As...

引用

International Conference on Computing, Networking and Communications (ICNC)

作者： Elwekeil, Mohamed Alghoniemy, Masoud Furukawa, Hiroshi Muta, Osamu Egypt Japan Univ Sci & Technol Elect & Commun Engn Dept Alexandria Egypt

ISBN: (纸本)9781467300094;9781467352871

The Channel assignment problem of multi-cell WLANs is important due to the lack of free available channels. Usually, this problem can be formulated as a mixed integer linear program (MILP) which requires high combinatorial complexity. In this paper, a lagrangian relaxation technique is used in order to transform the MILP into a low complexity linear program Simulation results show that the proposed channel assignment algorithm provides significant reduction in complexity compared to the MILP counterpart at the expense of insignificant increase in total interference-sum at Acess Points (APs). It is also suggested that that benefits of reduced complexity outweigh the increased interference.

关键词： WLAN IEEE 802.11 Channel assignment mixed integer linear programming optimization lagrangian relaxation

来源：评论

学校读者我要写书评

暂无评论

Caregivers' Assignment Problem in Home Health Care Structures

Caregivers' Assignment Problem in Home Health Care Structure...

引用

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

作者： Errarhout, Afrae Kharraja, Said Zorkani, Izeddine Univ St Etienne Lab Anal Signaux & Proc Ind Roanne France Univ Sidi Mohamed Ben Abdellah Fac Sci Dhar El Mahraz Fes Morocco

ISBN: (纸本)9782960053241

In this paper we introduce a caregivers' assignment problem related to the health home care (HHC) structures. This problem uses the generalized assignment problem as a reference. However, we consider more factors and constraints in order to better illustrate the real case. We take into account the caregivers (nurses) qualifications and capacity and we also include the districts where the patients live. The caregivers' capacity is the sum of the total visit time (the cares' workload) and the total travel time (the travels' workload). This problem's aim is to allocate the nurses while securing their workload equilibrium. We present a mixed integer linear programming model and the computational tests were done using CPLEX and produced good results very quickly.

关键词： assignment problem HHC mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Minimizing Virtual Machine Migration Probability for Cloud Environments

Minimizing Virtual Machine Migration Probability for Cloud E...

引用

15th IEEE International Conference on High Performance Computing and Communications (HPCC) /11th IEEE/IFIP International Conference on Embedded and Ubiquitous Computing (EUC)

作者： Chen, Xiaojiao Chen, Shiping Tseng, Fan-Hsun Chou, Li-Der Chao, Han-Chieh Shanghai Univ Sci & Technol Sch Opt Elect & Comp Engn Shanghai 201800 Peoples R China Shanghai Univ Sci & Technol Network Ctr Shanghai 201800 Peoples R China Natl Cent Univ Dept Comp Sci & Informat Engn Taoyuan Taiwan Natl Ilan Univ Inst Comp Sci & Informat Engn Ilan Taiwan Natl Dong Hwa Univ Dept Elect Engn Hualien Taiwan

ISBN: (纸本)9780769550886

In recent years, many researchers focus on how to balance the number of average virtual machines (VMs) in cloud data center. However, the VMs suddenly jumped to more than the utilization threshold of the physical machine (PM) and exhausted the computing resource, which will lead to VM migration and extra cost. In this paper, the VM migration problem in cloud computing is formulated based on mixed integer linear programming (MILP). Then we propose an Allocation algorithm to distribute the VMs among the PMs, which is based on the Support Vector Machine (SVM). The ultimate goal that not only minimizes the VM migration probability but also maximizes the PM resources as much as possible. According to the training data in a period time, the classified VMs can be allocated into the PMs with the lowest VM migration probability by the proposed Allocation algorithm. The simulation results show that the proposed algorithm can achieve lower VM migration probability and reduce the cost for the cloud environments.

关键词： cloud computing VM migration support vector machine mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：