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

mathematical modeling and solving procedure of the planar storage location assignment problem

COMPUTERS & INDUSTRIAL ENGINEERING 2009年第3期57卷 1062-1071页

作者： Park, Changkyu Seo, Junyong Univ Ulsan Coll Business Adm Ulsan 680749 South Korea

This paper focuses on the planar storage location assignment problem (PSLAP) that needs to be clearly defined and newly formulated. In addition, the solving procedure should be developed. The PSLAP can be defined as the assignment of the inbound and outbound objects to the storage yard with aim of minimizing the number of obstructive object moves. The storage yard allows only planar moves of objects. The PSLAP usually occurs in the assembly block stockyard operations at a shipyard. This paper formulates the PSLAP using a mathematical programming model, but which belongs to the NP-hard problems category. Thus this paper utilizes an efficient genetic algorithm (GA) to solve the PSLAP for real-sized instances. The performance of the proposed mathematical programming model and developed GA is verified by a number of numerical experiments. (C) 2009 Elsevier Ltd. All rights reserved.

关键词： Planar storage location assignment problem mathematical programming model Genetic algorithm Assembly block stockyard

来源：评论

学校读者我要写书评

暂无评论

A note on minimizing maximum lateness in an m-machine scheduling problem with a learning effect

引用

APPLIED MATHEMATICS AND COMPUTATION 2009年第2期209卷 186-190页

作者： Eren, Tamer Kirikkale Univ Dept Ind Engn Fac Engn TR-71451 Kirikkale Turkey

Conventionally, job processing times are assumed to be constant from the first job to be processed until the last job to be completed. However, recent empirical studies in several industries have verified that unit costs decline as firms produce more of a product and gain knowledge or experience. This phenomenon is known as the "learning effect". In this paper a m-identical parallel machine scheduling problem with a learning effect is considered. The objective function of the problem is to find a sequence that minimizes maximum lateness. A mathematical programming model is developed for the problem which belongs to NP-hard classes. Also the model is tested on an example. Results of computational tests show that the proposed model is effective in solving problems with 18 jobs and four machines. We also proposed heuristic approach for solving large jobs problems. (C) 2008 Elsevier Inc. All rights reserved.

关键词： Parallel machine scheduling Maximum lateness Learning effect mathematical programming model

来源：评论

学校读者我要写书评

暂无评论

A bicriteria parallel machine scheduling with a learning effect

引用

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2009年第11-12期40卷 1202-1205页

作者： Eren, Tamer Guner, Ertan Kirikkale Univ Fac Engn Dept Ind Engn TR-71451 Kirikkale Turkey Gazi Univ Fac Engn & Architecture Dept Ind Engn TR-06570 Ankara Turkey

Conventionally, job processing times are assumed to be constant from the first job to be processed until the last job to be completed. However, recent empirical studies in several industries have verified that unit costs decline as firms produce more of a product and gain knowledge or experience. This phenomenon is known as the "learning effect." In this paper a bicriteria m-identical parallel machine scheduling problem with a learning effect is considered. The objective function of the problem is to find a sequence that minimizes a weighted sum of total completion time and total tardiness. Total completion time and total tardiness are widely used performance measures in scheduling literature. To solve this scheduling problem, a mathematical programming model is formulated.

关键词： Parallel machine scheduling Bicriteria Learning effect Total completion time Total tardiness mathematical programming model

来源：评论

学校读者我要写书评

暂无评论

WTO agreement on agriculture: Potential consequences for agricultural production and land-use patterns in the Swiss lowlands

引用

GEOGRAFISK TIDSSKRIFT-DANISH JOURNAL OF GEOGRAPHY 2009年第2期109卷 131-145页

作者： Huber, Robert Lehmann, Bernard Swiss Fed Inst Technol Agri Food & Agri Environm Econ Grp Inst Environm Decis Zurich Switzerland

A strong link exists between agricultural production and landscape. Globalisation (more open agricultural markets) will change agricultural production and thus landscape will change as well. In this paper, we address the following questions: (a) what economic effects can be expected with respect to agricultural production structures in a high cost production region much as the Swiss lowlands given a substantial development in the WTO: and (b) how does this structural change influence land-use patterns? We discuss the expected economic effects from a theoretical point of view and implement these findings in a spatially explicit normative programming model for a case study region in the Swiss lowlands. The results show a wide range of possible economically efficient outcomes depending on production costs and farmers' preferences. Our results imply that, if production costs were to sink sufficiently, income maximizing farmers would focus on grassland based milk production. This would only lead to a modest change in the existing land-use patterns since our case study region is currently dominated by dairy farms. If production costs remain high, agricultural production would shift to more extensive production activities in order to maximize the sectoral income. In this case, the local landscape would change noticeably.

关键词： WTO land-use change mathematical programming model GIS modelling

来源：评论

学校读者我要写书评

暂无评论

Designing Reliable IP Networks with an Access/Edge/Core Hierarchical Structure

引用

INFOR 2009年第2期47卷 117-131页

作者： Chamberland, Steven Ecole Polytech Dept Comp & Software Engn Montreal PQ H3C 3A7 Canada

In this paper, we tackle the design problem of reliable internet protocol (IP) networks with a three-level (access/edge/core) hierarchical structure. This problem consists in selecting the number of routers of each type to install at each level, locating each router, selecting the port types to install in each router, finding the access, edge and core networks, selecting the link types and finally, routing the traffic within the network. The routes are computed using the shortest paths using link metrics as the lengths of the links such as for the open shortest path first (OSPF) routing protocol;the most widely deployed intra domain routing protocol in IP networks. Moreover, a minimum information rate traffic parameter is guaranteed between each pair of access devices (routers and switches) for the normal state of the network (no failure) and for all single core router failure scenarios. A mathematical programming model is proposed for this problem and a tabu-based metaheuristic algorithm is proposed to find solutions within a reasonable amount of computational time. Finally, numerical results are presented and analyzed. The results show that for the test problems generated, the proposed approach found solutions, on average, 3,17% from a lower bound.

关键词： Network design three-level (access/edge/core) networks mathematical programming model tabu search

来源：评论

学校读者我要写书评

暂无评论

A dynamic scheduling model of parallel-machine group for weapon production

引用

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2008年第11-12期36卷 1202-1209页

作者： Jiang, Jui-Chin Chen, Kou-Huang Wee, Hui-Ming Chung Yuan Christian Univ Dept Ind Engn Chungli 320 Taiwan

This study discusses weapon production using a single production stage with limited capability for production scheduling, and a parallel machine and a machine group dynamically flexible change strategy. An optimal schedule was created by integrating the schedule operation model into one-stage scheduling and combining it with a mathematical programming model. This study utilized Lindo 6.0 professional software. For verification and evaluation of computational results, the software program implemented a mathematical programming model, concluding with a comparison of the first-come-first-served (FCFS) technique. The proposed model yielded a favorable outcome and benefits, clearly assigning schedules for labor and production, thus obtaining the total least performance indicator for tardiness cost, earliness cost, and machine group changeover cost.

关键词： parallel machine group mathematical programming model first-come-first-served least total cost

来源：评论

学校读者我要写书评

暂无评论

Designing low cost access networks with IPTV performance constraints

Designing low cost access networks with IPTV performance con...

引用

4th Conference on Next Generation Internet Networks

作者： Chamberland, Steven Ecole Polytech Dept Comp & Software Engn Montreal PQ H3C 3A7 Canada

ISBN: (纸本)9781424417841

In this paper, we propose to tackle the global problem of designing an access network in order to have enough bandwidth to offer high definition television (HDTV) over the Internet protocol (IPTV). Two important access network architectures are considered: the fiber-to-the-node (FTTN) and the fiber-to-the-premises (FTTP) architectures. An integer mathematical programming model is proposed for this network planning problem. Next, a heuristic algorithm based on the tabu search principle is proposed to find "good" feasible solutions within a reasonable amount of computational time. Finally, numerical results are presented and analyzed.

关键词： access network design fiber-to-the-node (FTTN) fiber-to-the-micro-node (FTTn) fiber-to-the-premises (FTTP) very-high-speed digital subscriber line (VDSL2) gigabit-capable passive optical network (GPON) mathematical programming model tabu search

来源：评论

学校读者我要写书评

暂无评论

A MINLP-based Procedure for Assessing the Feasibility and Flexibility of Water Networks under Uncertain External Disturbances

A MINLP-based Procedure for Assessing the Feasibility and Fl...

引用

The 12th Asian Pacific Confederation of Chemical Engineering Congress

作者： Chuei-Tin Chang Chih-Wen Liou Department of Chemical Engineering National Cheng Kung UniversityTainanTaiwan 70101China

In designing any water network,a typical issue that must be addressed is concerned with the uncertain *** feasibility test and flexibility index models proposed by Grossmann and Floudas(1987)have been adopted and cust... 详细信息

关键词： total water network feasibility test flexibility index mathematical programming model inifialization strategy

来源：评论

学校读者我要写书评

暂无评论

End-to-end packet loss constrained routing and admission control for MPLS networks

End-to-end packet loss constrained routing and admission con...

引用

20th Annual Canadian Conference on Electrical and Computer Engineering

作者： Oulai, Desire Chamberland, Steven Pierre, Samuel Ecole Polytech Dept Comp Engn Montreal PQ H3C 3A7 Canada

ISBN: (纸本)9781424410200

Dynamic connection admission control (CAC) is an important mechanism to guarantee end-to-end quality of service (QoS) for specific Internet protocol (IP) traffic flows in multiprotocol label switching (MPLS) networks. Most of the solutions proposed in the literature target to satisfy the QoS constraints for the new request without considering them for the already admitted flows in the network. In this paper, we propose a joint routing and admission control mechanism for the IP traffic flows in MPLS networks. The solutions are obtained by solving exactly a mathematical programming model including end-to-end packet loss constraints for all traffic flows. Numerical results show that the model can be solved rapidly even for real-size instances of the problem.

关键词： multi-protocol label switching (MPLS) networks routing admission control quality of service (QoS) end-to-end packet loss mathematical programming model

来源：评论

学校读者我要写书评

暂无评论

Uplink UMTS network design - an integrated approach

引用

COMPUTER NETWORKS 2006年第15期50卷 2747-2761页

作者： St-Hilaire, Marc Chamberland, Steven Pierre, Samuel Ecole Polytech Dept Comp Engn Montreal PQ H3C 3A7 Canada

In this paper, we first propose a global approach for planning universal mobile telecommunications system (UMTS) networks in the uplink direction. Instead of partitioning the planning problem into several subproblems and solving them successively (sequential approach), we propose a mathematical programming model that addresses it as a whole. This global approach has the advantage of providing better results since, in general, optimal solutions to all subproblems do not provide an optimal solution to the global problem. In order to prove our point, we present a detailed example that compares the global and the sequential approaches. Next, we propose a local search heuristic to find "good" feasible solutions of the global model within a reasonable amount of time. Finally, numerical results for a set of randomly generated problems are presented. The results show that the heuristic produces solutions that are, on average, at 6.53% of the optimal solution, and in the worst case at 31.31% of the optimal solution. (c) 2005 Elsevier B.V. All rights reserved.

关键词： mobile networks universal mobile telecommunications system (UMTS) network planning global approach mathematical programming model branch-and-bound algorithm local search heuristic

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：