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

Two-stage flow-shop scheduling problem with non-identical second stage assembly machines

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2013年第9-12期69卷 2215-2226页

作者： Navaei, J. Ghomi, S. M. T. Fatemi Jolai, F. Shiraqai, M. E. Hidaji, H. Univ Windsor Intelligent Mfg Syst IMS Ctr Windsor ON N9B 3P4 Canada Amirkabir Univ Technol Dept Ind Engn Tehran Iran Univ Tehran Coll Engn Dept Ind Engn Tehran Iran Mazandaran Univ Sci & Technol Dept Ind Engn Babol Sar Iran

This paper addresses the two-stage assembly flow-shop problem (TSAFP) with multiple non-identical assembly machines in second stage with the objective function of makespan minimization. This problem is a generalization of previously proposed problems in TSAFP. Mathematical mixed-integer linear programming model of this problem is defined, and for it being NP-hard, a hybrid SA heuristic is proposed. The heuristic is proved to solve the problem in reduced time with negligible error. To validate the proposed method, a real-life example is presented and solved in which the efficiency of the proposed heuristic is shown.

关键词： Two-stage assembly flow-shop problem Multiple non-identical machines Mathematical model mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Scenario analysis of the new energy policy for Taiwan's electricity sector until 2025

引用

ENERGY POLICY 2013年 61卷 162-171页

作者： Chen, Fung-Fei Chou, Seng-Cho Lu, Tai-Ken Taiwan Power Co Res Inst Taipei 100 Taiwan Natl Taiwan Univ Dept Informat Management Taipei 106 Taiwan Natl Taiwan Ocean Univ Dept Elect Engn Keelung 202 Taiwan

For this study, we constructed the following three case scenarios based on the Taiwanese government's energy policy: a normal scenario, the 2008 "Sustainable Energy Policy Convention" scenario, and the 2011 "New Energy Policy" scenario. We then employed a long-term Generation Expansion Planning (GEP) optimization model to compare the three case scenarios' energy mix for power generation for the next (a) over circle 15 years to further explore their possible impact on the electricity sector. The results provide a reference for forming future energy policies and developing strategic responses. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： Scenario analysis Energy policy mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Reactive scheduling in a make-to-order flexible job shop with re-entrant process and assembly: a mathematical programming approach

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2013年第17期51卷 5120-5141页

作者： Gomes, Marta Castilho Barbosa-Povoa, Ana Paula Novais, Augusto Queiroz Univ Tecn Lisboa Inst Super Tecn CESUR P-1049001 Lisbon Portugal Univ Tecn Lisboa Inst Super Tecn CEG IST P-1049001 Lisbon Portugal Natl Lab Energy & Geol UMOSE Unit Energy Syst Modelling & Optimizat P-1649038 Lisbon Portugal

A mixed-integer linear programming model is presented for the scheduling of flexible job shops, a production mode characteristic of make-to-order industries. Re-entrant process (multiple visits to the same machine group) and a final assembly stage are simultaneously considered in the model. The formulation uses a continuous time representation and optimises an objective function that is a weighted sum of order earliness, order tardiness and in-process inventory. An algorithm for predictive-reactive scheduling is derived from the proposed model to deal with the arrival of new orders. This is illustrated with a realistic example based on data from the mould making industry. Different reactive scheduling scenarios, ranging from unchanged schedule to full re-scheduling, are optimally generated for order insertion in a predictive schedule. Since choosing the most suitable scenario requires balancing criteria of scheduling efficiency and stability, measures of schedule changes were computed for each re-scheduling solution. The short computational times obtained are promising regarding future application of this approach in the manufacturing environment studied.

关键词： reactive scheduling flexible job shop re-entrant process assembly mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Economic and environmental aspects Of the component sizing for a stand-alone building energy system: A case study

引用

RENEWABLE ENERGY 2013年第Jul.期55卷 438-447页

作者： Fux, Samuel F. Benz, Michael J. Guzzella, Lino ETH Dept Mech & Proc Engn CH-8092 Zurich Switzerland

When designing a building energy system based on renewable energy sources, a major challenge is the suitable sizing of its components. In this paper, a simulation tool is presented for determining the optimal sizes of the main components of a stand-alone building energy system which integrates both thermal and electric renewable energy sources. Since the control of this multisource energy system is a non-trivial, multivariable control problem, particular emphasis is placed on the energy management system. A control structure based on model predictive control is proposed, whereas the underlying optimal control problem is formulated as a mixed-integer linear programming problem. The simulation tool developed is successfully applied on the specific case of an alpine lodge. A set of potential configurations, each being optimal with respect to both the net present costs and the global warming potential, is generated by analyzing the system for various component sizes. Out of this set, the decision makers can choose the most cost efficient configuration fulfilling their specifications. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： Stand-alone energy system Renewable energy sources Optimal component sizing Model predictive control mixed-integer linear programming Global warming potential

来源：评论

学校读者我要写书评

暂无评论

A dynamic pricing approach for returned products in integrated forward/reverse logistics network design

引用

APPLIED MATHEMATICAL MODELLING 2013年第24期37卷 10182-10202页

作者： Keyvanshokooh, E. Fattahi, M. Seyed-Hosseini, S. M. Tavakkoli-Moghaddam, R. Iran Univ Sci & Technol Dept Ind Engn Tehran Iran Amirkabir Univ Technol Dept Ind Engn & Management Syst Tehran Iran Univ Tehran Coll Engn Dept Ind Engn Tehran Iran

During the last decade, the stringent pressures from environmental and social requirements have spurred an interest in designing a reverse logistics network. In this paper, we address the problem of designing and planning a multi-echelon, multi-period, multi-commodity and capacitated integrated forward/reverse logistics network. Returned products are categorized with respect to their quality levels, and a different acquisition price is offered for each return type. Furthermore, the reservation incentive of customers, the expected price of customers for one unit of used product described by uniform distribution, is applied to model the customers' return willingness. Due to the fact that the remaining worthwhile value in the used products is the corporation's key motivation for buying them from customers, a dynamic pricing approach is developed to determine the acquisition price for these products and based on it determine the percentage of returned products collected from customer zones. The used products' acquisition prices at each time period are determined based on the customers' return willingness by each collection center. A novel mixed-integer linear programming is developed to consider dynamic pricing approach for used products, forward/reverse logistics network configuration and inventory decisions, concurrently. The presented model is solved by commercial solver CPLEX for some test problems. Computational results indicate that the effect of a dynamic pricing approach for used products versus a static pricing one, and the linearization of pricing concept for this model have the acceptable solution. In addition, sensitivity analysis is conducted to show the performance of the proposed model. (C) 2013 Elsevier Inc. All rights reserved.

关键词： Supply chain management Integrated forward/reverse logistics Quality levels Dynamic pricing approach mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A continuous-time MILP model for short-term scheduling of make-and-pack production processes

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2013年第6期51卷 1707-1727页

作者： Baumann, Philipp Trautmann, Norbert Univ Bern Dept Business Adm CH-3012 Bern Switzerland

In process industries, make-and-pack production is used to produce food and beverages, chemicals, and metal products, among others. This type of production process allows the fabrication of a wide range of products in relatively small amounts using the same equipment. In this article, we consider a real-world production process (cf. Honkomp et al. . The curse of reality why process scheduling optimization problems are diffcult in practice. Computers & Chemical Engineering, 24, 323328.) comprising sequence-dependent changeover times, multipurpose storage units with limited capacities, quarantine times, batch splitting, partial equipment connectivity, and transfer times. The planning problem consists of computing a production schedule such that a given demand of packed products is fulfilled, all technological constraints are satisfied, and the production makespan is minimised. None of the models in the literature covers all of the technological constraints that occur in such make-and-pack production processes. To close this gap, we develop an efficient mixed-integer linear programming model that is based on a continuous time domain and general-precedence variables. We propose novel types of symmetry-breaking constraints and a preprocessing procedure to improve the model performance. In an experimental analysis, we show that small- and moderate-sized instances can be solved to optimality within short CPU times.

关键词： make-and-pack production mixed-integer linear programming symmetry-breaking constraints preprocessing real-world production process

来源：评论

学校读者我要写书评

暂无评论

Optimization models for differentiating quality of service levels in probabilistic network capacity design problems

引用

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL 2013年 58卷 71-91页

作者： Shen, Siqian Chen, Zhihao Univ Michigan Dept Ind & Operat Engn Ann Arbor MI 48109 USA

This paper develops various chance-constrained models for optimizing the probabilistic network design problem (PNDP), where we differentiate the quality of service (QoS) and measure the related network performance under uncertain demand. The upper level problem of PNDP designs continuous/discrete link capacities shared by multi-commodity flows, and the lower level problem differentiates the corresponding QoS for demand satisfaction, to prioritize customers and/or commodities. We consider PNDP variants that have either fixed flows (formulated at the upper level) or recourse flows (at the lower level) according to different applications. We transform each probabilistic model into a mixed-integer program, and derive polynomial-time algorithms for special cases with single-row chance constraints. The paper formulates benchmark stochastic programming models by either enforcing to meet all demand or penalizing unmet demand via a linear penalty function. We compare different models and approaches by testing randomly generated network instances and an instance built on the Sioux-Falls network. Numerical results demonstrate the computational efficacy of the solution approaches and derive managerial insights. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： Network design problem Quality of Service (QoS) Chance-constrained programming Stochastic programming mixed-integer linear programming Multi-commodity network flows

来源：评论

学校读者我要写书评

暂无评论

Optimal Conductor Size Selection and Reconductoring in Radial Distribution Systems Using a mixed-integer LP Approach

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2013年第1期28卷 10-20页

作者： Franco, John F. Rider, Marcos J. Lavorato, Marina Romero, Ruben UNESP Univ Estadual Paulista Fac Engn Ilha Solteira Dept Engn Eletr Ilha Solteira SP Brazil

This paper presents a mixed-integer linear programming model to solve the conductor size selection and reconductoring problem in radial distribution systems. In the proposed model, the steady-state operation of the radial distribution system is modeled through linear expressions. The use of a mixed-integer linear model guarantees convergence to optimality using existing optimization software. The proposed model and a heuristic are used to obtain the Pareto front of the conductor size selection and reconductoring problem considering two different objective functions. The results of one test system and two real distribution systems are presented in order to show the accuracy as well as the efficiency of the proposed solution technique.

关键词： Distribution system optimization mixed-integer linear programming optimal conductor size selection

来源：评论

学校读者我要写书评

暂无评论

Two-machine robotic cell scheduling problem with sequence-dependent setup times

引用

COMPUTERS & OPERATIONS RESEARCH 2013年第5期40卷 1420-1434页

作者： Zarandi, M. H. Fazel Mosadegh, H. Fattahi, M. Amirkabir Univ Technol Dept Ind Engn & Management Syst Tehran *** Iran

In this paper, we introduce a new and practical two-machine robotic cell scheduling problem with sequence-dependent setup times (2RCSDST) along with different loading/unloading times for each part. Our objective is to simultaneously determine the sequence of robot moves and the sequence of parts that minimize the total cycle time. The proposed problem is proven to be strongly NP-hard. Using the Gilmore and Gomory (GnG) algorithm, a polynomial-time computable lower bound is provided. Based on the input parameters, a dominance condition is developed to determine the optimal sequence of robot moves for a given sequence of parts. A mixed-integer linear programming (MILP) model is provided and enhanced using a valid inequality based on the given dominance condition. In addition, a branch and bound (BnB) algorithm is exploited to solve the problem, and due to the NP-hardness, an improved simulated annealing (SA) algorithm is proposed to address large-sized test problems. All the solution methods are evaluated using small-, medium- and large-sized test problems. The numerical results indicate that the optimal solution of the MILP model is attained for the medium- and some large-sized test problems, and the proposed SA, tuned using the Taguchi technique, provides an acceptable, near-optimal solution with markedly reduced CPU time. Moreover, the lower bound is observed to be significantly near the optimal solution. Thus, this lower bound is exploited to validate the results of the SA algorithm for large-sized test problems. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Robotic cell scheduling Sequence-dependent setup times mixed-integer linear programming Simulated annealing Branch and bound Taguchi

来源：评论

学校读者我要写书评

暂无评论

Modelling disruptions and resolving conflicts optimally in a railway schedule

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2013年第1期64卷 469-481页

作者： Narayanaswami, Sundaravalli Rangaraj, Narayan Higher Coll Technol Abu Dhabi U Arab Emirates Indian Inst Technol Bombay 400076 Maharashtra India

Resolving disruptions, by dispatching and rescheduling conflicting trains is an NP-complete problem. Earlier literature classify railway operations as: (i) tactical scheduling, (ii) operational scheduling, and (iii) rescheduling. We distinguish the three based on operational criticality. Existing optimisation models do not distinguish precisely between scheduling and rescheduling based on constraints modelling;the only difference is in their objective function. Our model is the first of its kind to incorporate disruptions in an MILP model and to include conflicts-resolving constraints in the model itself. The major advantage of such a formulation is that only those trains which are disrupted are rescheduled and other nonconflicting trains retain their original schedules. Our model reschedules disrupted train movements on both directions of a single track layout with an objective to minimise total delay of all trains at their destinations. Using a small sized data it is proved that all possible conflicts out of a disruption are resolved. Apart from achieving optimal resolutions, we infer through experimental verification that a non-standard dispatch ordering is a requisite for global optimality, as cogitated by other authors. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Disruption Conflicts Optimal resolution Single-track railway mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：