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

Optimal level schedules in mixed-model, multi-level JIT assembly systems with pegging

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 1996年第1期95卷 38-52页

作者： Steiner, G Yeomans, JS YORK UNIV FAC ADM STUDIES MANAGEMENT SCI AREA N YORK ON M3J 1P3 CANADA MCMASTER UNIV FAC BUSINESS MANAGEMENT SCI & INFORMAT SYST AREA HAMILTON ON L8S 4M4 CANADA

Solving the level (or balanced) schedule problem is the most important scheduling goal for just-in-time production assembly systems. For most industrial applications, determining the optimal balanced schedule in a multi-level facility is a very difficult combinatorial problem, However, if outputs at production levels which feed the final assembly level are dedicated or 'pegged' to the final product into which they will be assembled, then it can be shown that an efficient scheduling algorithm can be implemented to determine the optimal level schedule, It can also be shown that several symmetrical properties of the pegging model can be exploited to significantly reduce the computational requirements of the problem.

关键词： scheduling just-in-time nonlinear integer programming

来源：评论

学校读者我要写书评

暂无评论

Effectiveness of Aircraft Inter-Arrival Control in Upstream Traffic Flow via a Combined Tandem Fluid Queue Model and integer programming Approach

引用

IEEE ACCESS 2023年 11卷 15252-15270页

作者： Higasa, Koki Sekine, Katsuhiro Itoh, Eri Univ Tokyo Dept Aeronaut & Astronaut Tokyo 1138656 Japan Tokyo Univ Sci Dept Informat & Comp Technol Tokyo 1628601 Japan Elect Nav Res Inst Air Traff Management Dept Tokyo 1820012 Japan

Conventionally, several studies indicated that controlling aircraft arrival time in the en-route airspace mitigates arrival aircraft congestion in the terminal airspace. Further research is required to clarify how to leverage this idea to design an air traffic management system, a so-called Extended Arrival MANager (E-AMAN), to reduce the arrival traffic flow while assisting air traffic controllers and boosting their effectiveness quantitatively. Under these circumstances, this research proposed aircraft inter-arrival time control within the en-route airspace and clarified its effectiveness in reducing arrival delay based on mathematical modeling and simulation evaluations. In this paper, we developed the G(t)/GI/s(t) + GI tandem fluid model to analyze the time-varying delay time of flights in both en-route and terminal airspace and demonstrated the effect of inter-arrival time control in the upstream arrival traffic flow in the en-route airspace, combining the model with the nonlinear integer programming problem. The calculation results for 3,074 aircraft over 21 days, arriving at Tokyo International Airport between 17:00 and 22:00, show the possibility for the control to reduce the mean and maximum delay time for flights by 18.8% (5.0 s) and 16.5% (37.6 s) on average within the en-route airspace. Moreover, fast-time simulation by AirTOP is conducted to validate the control, revealing the scope to reduce mean and maximum delay times in the terminal airspace by 11.5% (36.5 s) and 19.2% (148.8 s) on average.

关键词： Atmospheric modeling Delays Aircraft Air traffic control Airports Analytical models nonlinear systems Air traffic management arrival management nonlinear integer programming tandem fluid model

来源：评论

学校读者我要写书评

暂无评论

Practical Inner Codes for BATS Codes in Multi-Hop Wireless Networks

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2019年第3期68卷 2751-2762页

作者： Zhou, Zhiheng Li, Congduan Yang, Shenghao Guang, Xuan Univ Elect Sci & Technol China Natl Key Lab Sci & Technol Commun Chengdu 611731 Sichuan Peoples R China Sun Yat Sen Univ Sch Elect & Commun Engn Shenzhen 518000 Peoples R China Chinese Univ Hong Kong Sch Sci & Engn Shenzhen 518172 Peoples R China Chinese Univ Hong Kong Shenzhen Key Lab IoT Intelligent Syst & Wireless Shenzhen 518172 Peoples R China Shenzhen Res Inst Big Data Shenzhen 518172 Guangdong Peoples R China Nankai Univ Sch Math Sci Tianjin 300071 Peoples R China Nankai Univ LPMC Tianjin 300071 Peoples R China

Batched sparse (BATS) codes are a promising technique for reliable data transmission in multihop wireless networks. ABATS code consists of an outer code and an inner code, the design of which can be separated. In this paper, we investigate the design of the inner code and focus on maximizing the expected batch transfer matrix rank normalized by the total number of packets transmitted by both the source and intermediate nodes. By allowing different recoding decisions at different nodes, the problem is formulated as a nonlinear integer programming (NLIP) problem, which is non-deterministic polynomial (NP)-hard in general. We derive a noniterative formula to simplify the evaluation of the expected batch transfermatrix rank. By considering large finite fields and relaxing the integer constraints, we obtain an upper bound on the optimal value of the original maximization NLIP problem. We also derive a centralized and a decentralized algorithm to find suboptimal solutions of the NLIP problem, with different trade-offs between complexity and performance. Numerical results show that our proposed inner codes outperform the standard BATS, and achieve very close to the upper bound, which verifies the near optimality of our algorithms.

关键词： Network coding BATS codes batched sparse codes nonlinear integer programming

来源：评论

学校读者我要写书评

暂无评论

A location-allocation problem for a web services provider in a competitive market

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2009年第1期194卷 64-77页

作者： Aboolian, Robert Sun, Yi Koehler, Gary J. Calif State Univ San Marcos Coll Business Adm San Marcos CA 92096 USA Univ Florida Warrington Coll Business Adm Gainesville FL 32611 USA

Web Services have become a viable component technology in distributed e-commerce platforms. Due to the move to high-speed Internet communication and tremendous increases in computing power, network latency has begun to play a more important role in determining service response time. Hence, the locations of a Web Services provider's facilities, customer allocation, and the number of servers at each facility have a significant impact on its performance and customer satisfaction. In this paper we introduce a location-allocation model for a Web Services provider in a duopoly competitive market. Demands for services of these servers are available at each node of a network, and a subset of nodes is to be chosen to locate one or more servers in each. The objective is to maximize the provider's profit. The problem is formulated and analyzed. An exact solution approach is developed and the results of its efficiency are reported. (c) 2007 Elsevier B.V. All rights reserved.

关键词： Web Services Competitive facility location models nonlinear integer programming

来源：评论

学校读者我要写书评

暂无评论

The Retail Planning Problem Under Demand Uncertainty

引用

PRODUCTION AND OPERATIONS MANAGEMENT 2013年第5期22卷 1200-1213页

作者： Georgiadis, George Rajaram, Kumar Univ Calif Los Angeles Anderson Sch Management Los Angeles CA 90095 USA

We consider the retail planning problem in which the retailer chooses suppliers and determines the production, distribution, and inventory planning for products with uncertain demand to minimize total expected costs. This problem is often faced by large retail chains that carry private-label products. We formulate this problem as a convex-mixed integer program and show that it is strongly NP-hard. We determine a lower bound by applying a Lagrangian relaxation and show that this bound outperforms the standard convex programming relaxation while being computationally efficient. We also establish a worst-case error bound for the Lagrangian relaxation. We then develop heuristics to generate feasible solutions. Our computational results indicate that our convex programming heuristic yields feasible solutions that are close to optimal with an average suboptimality gap at 3.4%. We also develop managerial insights for practitioners who choose suppliers and make production, distribution, and inventory decisions in the supply chain.

关键词： retailing facility location inventory management stochastic demand nonlinear integer programming

来源：评论

学校读者我要写书评

暂无评论

Genetic algorithm-based multi-criteria project portfolio selection

引用

ANNALS OF OPERATIONS RESEARCH 2012年第1期197卷 71-86页

作者： Yu, Lean Wang, Shouyang Wen, Fenghua Lai, Kin Keung Chinese Acad Sci Acad Math & Syst Sci Inst Syst Sci MADIS Beijing 100190 Peoples R China Changsha Univ Sci & Technol Sch Econ & Management Res Ctr Financial Engn & Financial Management Changsha 410114 Hunan Peoples R China City Univ Hong Kong Dept Management Sci Kowloon Hong Kong Peoples R China

Project portfolio selection is one of the most important decision-making problems for most organizations in project management and engineering management. Usually project portfolio decisions are very complicated when project interactions in terms of multiple selection criteria and preference information of decision makers (DMs) in terms of the criteria importance are taken into consideration simultaneously. In order to solve this complex decision-making problem, a multi-criteria project portfolio selection problem considering project interactions in terms of multiple selection criteria and DMs' preferences is first formulated. Then a genetic algorithm (GA)-based nonlinear integer programming (NIP) approach is used to solve the multi-criteria project portfolio selection problem. Finally, two illustrative examples are presented for demonstration and verification purposes. Experimental results obtained indicate that the GA-based NIP approach can be used as a feasible and effective solution to multi-criteria project portfolio selection problems.

关键词： Multi-criteria decision making nonlinear integer programming Genetic algorithm Project portfolio selection Project interactions Preference

来源：评论

学校读者我要写书评

暂无评论

Damage assessment for optimal rollback recovery

引用

IEEE TRANSACTIONS ON COMPUTERS 1998年第5期47卷 603-613页

作者： Lin, TH Shin, KG Microtec Mentor Graph Santa Clara CA 95054 USA Univ Michigan Dept Elect Engn & Comp Sci Real Time Comp Lab Ann Arbor MI 48109 USA

Conventional schemes of rollback recovery with checkpointing for concurrent processes have overlooked an important problem: contamination of checkpoints as a result of error propagation among the cooperating processes. Error propagation is unavoidable due to imperfect detection mechanisms and random interprocess communications, and it could give rise to contaminated checkpoints which, in turn, result in unsuccessful rollbacks. To counter the problem of error propagation, a damage assessment model is developed to estimate the correctness of saved checkpoints under various circumstances. Using the result of damage assessment, determination of the "optimal" checkpoints for rollback recovery-which minimize the average total recovery overhead-is formulated and solved as a nonlinear integer programming problem. Integration of damage assessment into existing recovery schemes is also discussed.

关键词： damage assessment error propagation rollback recovery checkpointing nonlinear integer programming

来源：评论

学校读者我要写书评

暂无评论

Combining QCR and CHR for convex quadratic pure 0-1 programming problems with linear constraints

引用

ANNALS OF OPERATIONS RESEARCH 2012年第1期199卷 33-49页

作者： Ahlatcioglu, Aykut Bussieck, Michael Esen, Mustafa Guignard, Monique Jagla, Jan-Hendrick Meeraus, Alexander Univ Penn Philadelphia PA 19104 USA Princeton Univ Princeton NJ 08544 USA GAMS Dev Corp Washington DC USA

The convex hull relaxation (CHR) method (Albornoz in Doctoral Dissertation, 1998, Ahlat double dagger A +/- oglu in Summer paper, 2007, Ahlat double dagger A +/- oglu and Guignard in OPIM Dept. Report, 2010) provides lower bounds and feasible solutions on convex 0-1 nonlinear programming problems with linear constraints. In the quadratic case, these bounds may often be improved by a preprocessing step that adds to the quadratic objective function terms that are equal to 0 for all 0-1 feasible solutions yet increase its continuous minimum. Prior to computing CHR bounds, one may use Plateau's quadratic convex reformulation (QCR) method (2006), or one of its weaker predecessors designed for unconstrained problems, the eigenvalue method of Hammer and Rubin (RAIRO 3:67-79, 1970) or the method of Billionnet and Elloumi (Math. Program, Ser. A 109:55-68, 2007). In this paper, we first describe the CHR method, and then present the QCR reformulation methods. We present computational results for convex GQAP problems.

关键词： nonlinear integer programming Bounds Relaxation Convex hull CHR QCR SDP GQAP

来源：评论

学校读者我要写书评

暂无评论

nonlinear 0-1 programming .1. LINEARIZATION TECHNIQUES

引用

MATHEMATICAL programming 1984年第1期30卷 1-21页

作者： BALAS, E MAZZOLA, JB CARNEGIE MELLON UNIV PITTSBURGH PA 15213 USA UNIV N CAROLINA CHAPEL HILL NC 27514 USA

Any real-valued nonlinear function in 0–1 variables can be rewritten as a multilinear function. We discuss classes of lower and upper bounding linear expressions for multilinear functions in 0–1 variables. For any multilinear inequality in 0–1 variables, we define an equivalent family of linear inequalities. This family contains the well-known system of generalized covering inequalities, as well as other linear equivalents of the multilinear inequality that are more compact, i.e., of smaller cardinality. In a companion paper [7]. we discuss dominance relations between various linear equivalents of a multilinear inequality, and describe a class of algorithms for multilinear 0–1 programming based on these results.

关键词： nonlinear integer programming Multilinear Functions Linearization of Multilinear Inequalities

来源：评论

学校读者我要写书评

暂无评论

Mathematical models to improve the current practice in a Home Healthcare Unit

引用

OR SPECTRUM 2020年第1期42卷 43-74页

作者： Quintanilla, Sacramento Ballestin, Francisco Perez, Angeles Univ Valencia Dept Matemat Econ & Empresa Valencia 46022 Spain

This paper addresses a home healthcare routing problem in which doctors and nurses visit patients at their homes to provide services. We consider a real-world home healthcare service arising in a particular hospital in Spain. Doctors and nurses are distributed in teams and travel by taxi;taxis transport a pre-defined set of workers who travel together the whole route. The objective is to minimise the transportation costs related to the total taxi journey time, including travelling and waiting costs. The paper presents a mathematical model that considers these current policies and permits the problem to be solved optimally. The paper also explores, after reviewing the hospital's current model, the benefits that can be obtained by changing some of the current policies of the hospital. In this way, a new model is proposed based on two sustainable strategies that can be extended to other home service fields: (1) workers can walk between houses and (2) the workers transported by a taxi may change during the route. A complex nonlinear mathematical model is presented, and a metaheuristic is designed to provide quality solutions. Computational tests on a set of instances based on real-world data estimate the gap between the solutions of both models.

关键词： Home healthcare problem Heuristics nonlinear integer programming Linear integer programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：