The Lagrangian relaxation and cut generation technique is applied to solve sequence-dependent setup time flowshop scheduling problems to minimise the total weighted tardiness. The original problem is decomposed into i...
详细信息
The Lagrangian relaxation and cut generation technique is applied to solve sequence-dependent setup time flowshop scheduling problems to minimise the total weighted tardiness. The original problem is decomposed into individual job-level subproblems that can be effectively solved by dynamic programming. Two types of additional constraints for the violation of sequence-dependent setup time constraints are imposed on the decomposed subproblems in order to improve the lower bound. The decomposed subproblem with the additional setup time constraints on any subset of jobs is also effectively solved by a novel dynamic programming. Computational results show that the lower bound derived by the proposed method is much better than those of CPLEX and branch and bound for problem instances with 50 jobs and five stages with less computational effort.
This article presents a mixed-integerprogramming model for a multitype facility colocation problem with capacity expansion over a multiperiod horizon. This problem is motivated by the emerging U.S. biofuel industry t...
详细信息
This article presents a mixed-integerprogramming model for a multitype facility colocation problem with capacity expansion over a multiperiod horizon. This problem is motivated by the emerging U.S. biofuel industry that is rapidly expanding its infrastructure facilities to produce bioethanol from agricultural crops. Each type of facility (e.g., corn- or cellulose-based biorefinery) requires a different type of raw material (e.g., corn or perennial grass), but they produce the same final product (e.g., bioethanol), and colocation of multiple types of facilities results in cost-saving benefits due to complementary production process and byproduct recycling. Multiple solution approaches (i.e., Lagrangian relaxation, Benders decomposition, and accelerated Benders decomposition) are proposed to solve this problem. Numerical experiments show that accelerated Benders decomposition most effectively solves large-sized problems in a short amount of time. Various managerial insights are also drawn from the computational results.
This paper proposes a novel mixed integer linear programming model to solve a supply chain network design problem. The proposed model deals with major issues for supply chains;product quality and cost. These issues ar...
详细信息
This paper proposes a novel mixed integer linear programming model to solve a supply chain network design problem. The proposed model deals with major issues for supply chains;product quality and cost. These issues are usually solved separately, but in this paper, we investigate effects of product quality on supply chain design and transportation flow. A trade-off between raw material quality, its purchasing and reprocessing costs was considered. Assuming decision maker (DM) wishes to work with a supplier which serves a low quality raw material;this raw material should be in need of reprocessing. To avoid the reprocessing costs, a supplier which serves a high quality raw material should be chosen but at this time the DM has to face a high purchasing cost. A supply chain network which consists of multiple suppliers, manufacturers, distribution centers and retailers is tried to be designed to accomplish aforementioned above trade-offs. The paper examines and discusses the relationship between product quality and supply chain design and offers several managerial insights.
In this paper, we minimize the weighted and unweighted number of tardy jobs on a single batch processing machine with incompatible job families. We propose two different mixed integer linear programming (MILP) formula...
详细信息
In this paper, we minimize the weighted and unweighted number of tardy jobs on a single batch processing machine with incompatible job families. We propose two different mixed integer linear programming (MILP) formulations based on positional variables. The second formulation does not contain a big-M coefficient. Two iterative schemes are discussed that are able to provide tighter linearprogramming bounds by reducing the number of positional variables. Furthermore, we also suggest a random key genetic algorithm (RKGA) to solve this scheduling problem. Results of computational experiments are shown. The second MILP formulation is more efficient with respect to lower bounds, while the first formulation provides better upper bounds. The iterative scheme is effective for the weighted case. The RKGA is able to find high-quality solutions in a reasonable amount of time. (C) 2012 Elsevier Ltd. All rights reserved.
Bioethanol produced from lignocellulosic feedstock show enormous potential as an economically and environmentally sustainable renewable energy source. Switchgrass (panicum virgatum) is considered as one of the best se...
详细信息
Bioethanol produced from lignocellulosic feedstock show enormous potential as an economically and environmentally sustainable renewable energy source. Switchgrass (panicum virgatum) is considered as one of the best second generation feedstock for bioethanol production. In order to commercialize the production of switchgrass-based bioethanol, it is essential to design an efficient switchgrass-based bioethanol supply chain (SBSC) and effectively manage the logistics operation. This paper proposes an integrated mathematical model to determine the optimal comprehensive supply chain/logistics decisions to minimize the total SBSC cost by considering existing constraints. A case study based on North Dakota state (ND) in the United States illustrates the application of the proposed model. The results demonstrate that by using only 61% of the available marginal land for production of switchgrass feedstock, 100% of the annual gasoline energy equivalent requirement of ND can be economically and sustainably met from the produced bioethanol. Sensitivity analysis is conducted to provide insights for efficiently managing the entire SBSC and minimizing the total cost. (c) 2012 Elsevier Ltd. All rights reserved.
Nowadays, the efficient design of medical service systems plays a critical role in improving the performance and efficiency of medical services provided by governments. Accordingly, health care planners in countries e...
详细信息
Nowadays, the efficient design of medical service systems plays a critical role in improving the performance and efficiency of medical services provided by governments. Accordingly, health care planners in countries especially with a system based on a National Health Service (NHS) try to make decisions on where to locate and how to organize medical services regarding several conditions in different residence areas, so as to improve the geographic equity of comfortable access in the delivery of medical services while accounting for efficiency and cost issues especially in crucial situations. Therefore, optimally locating of such services and also suitable allocating demands them, can help to enhance the performance and responsiveness of medical services system. In this paper, a multiobjective mixedinteger nonlinearprogramming model is proposed to decide locations of new medical system centers, link roads that should be constructed or improved, and also urban residence centers covered by these medical service centers and link roads under investment budget constraint in order to both minimize the total transportation cost of the overall system and minimize the total failure cost (i.e., maximize the system reliability) of medical service centers under unforeseen situations. Then, the proposed model is linearized by suitable techniques. Moreover, a practical case study is presented in detail to illustrate the application of the proposed mathematical model. Finally, a sensitivity analysis is done to provide an insight into the behavior of the proposed model in response to changes of key parameters of the problem.
The integration of the spot electricity markets in Europe shall lead to multi-area power exchanges that will substitute the local markets. In view of the "target model" that will be enforced in all European ...
详细信息
The integration of the spot electricity markets in Europe shall lead to multi-area power exchanges that will substitute the local markets. In view of the "target model" that will be enforced in all European markets and the forthcoming coupling/integration of the Greek with the Italian electricity market, a volume-based market coupling between a power exchange (PX) and a power pool is implemented in this paper. The pros and cons of this approach are quantified, and the attained results are compared with the results of a single market splitting approach, in terms of pricing, overall social welfare and computational time. (c) 2013 Elsevier B.V. All rights reserved.
Data envelopment analysis (DEA) has been a very popular method for measuring and benchmarking relative efficiency of each decision making units (DMUs) with multiple inputs and multiple outputs. DEA and Discriminant An...
详细信息
Data envelopment analysis (DEA) has been a very popular method for measuring and benchmarking relative efficiency of each decision making units (DMUs) with multiple inputs and multiple outputs. DEA and Discriminant Analysis (DA) are similar in classifying units to exhibit either good or poor performance. On the other hand, selecting the most efficient unit between several efficient ones is one of the main issues in multi-criteria decision making (MCDM). Some proponents have suggested some approaches and claimed their methodologies involve discriminating power to determine the most efficient DMU without explicit input. This paper focuses on the weakness of a recent methodology of these approaches and to avoid this drawback presents a mixedintegerprogramming (MIP) approach. To illustrate this drawback and compare discriminating power of the recent methodology to our new approach, a real data set containing 40 professional tennis players is utilized. (C) 2013 Elsevier Ltd. All rights reserved.
One of the important stages in supply chain management which regards all the activities from the purchasing of raw material to final delivery of the product is the supplier selection process. Since it is the first sta...
详细信息
One of the important stages in supply chain management which regards all the activities from the purchasing of raw material to final delivery of the product is the supplier selection process. Since it is the first stage of the supply chain management, it is a critical process affecting the consecutive stages. It is simply desired to select the best supplier for a specific product. But since there are a lot of criteria and alternatives to be considered, numerous decision making models have been proposed to provide a solution to this problem. Within this study, an integrated approach including fuzzy Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) and a mixed integer linear programming model is developed to select the best supplier in a multi-item/multi-supplier environment. The importance value of each supplier with respect to each product is obtained via fuzzy TOPSIS in the first stage. Then in the second stage, these values are used as an input in the mathematical model which determines the suppliers and the quantities of products to be provided from the related suppliers. So as to validate the proposed methodology, an application is performed in air filter sector. (C) 2013 Elsevier Inc. All rights reserved.
This article is a sequel to a recent article that appeared in this journal, "An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations" [17], in which an inte...
详细信息
This article is a sequel to a recent article that appeared in this journal, "An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations" [17], in which an integerprogramming formulation to the problem of rescheduling in-flight assets due to changes in battlespace conditions was presented. The purpose of this article is to present an improved branch-and-bound procedure to solve the dynamic resource management problem in a timely fashion, as in-flight assets must be quickly re-tasked to respond to the changing environment. To facilitate the rapid generation of attractive updated mission plans, this procedure uses a technique for reducing the solution space, supports branching on multiple decision variables simultaneously, incorporates additional valid cuts to strengthen the minimal network constraints of the original mathematical model, and includes improved objective function bounds. An extensive numerical analysis indicates that the proposed approach significantly outperforms traditional branch-and-bound methodologies and is capable of providing improved feasible solutions in a limited time. Although inspired by the dynamic resource management problem in particular, this approach promises to be an effective tool for solving other general types of vehicle routing problems. (C) 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 141-159, 2013
暂无评论