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

Determining end-of-life policy for recoverable products

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2017年第19期55卷 5782-5800页

作者： Steeneck, Daniel W. Sarin, Subhash C. Virginia Tech Grado Dept Ind & Syst Engn Blacksburg VA 24061 USA MIT Ctr Transportat & Logist 77 Massachusetts Ave Cambridge MA 02139 USA Air Force Inst Technol Dept Operat Sci Wright Patterson AFB OH 45433 USA

We address a problem that arises for an original equipment manufacturer (OEM) who produces a product both in new and remanufactured forms. A remanufactured product is produced using the parts harvested from recovered products (cores) upon their disassembly, and it may contain some new parts while the excess good parts from cores are salvaged for profit. Other options are available to the OEM for handling cores that do not require disassembly. It follows that the per-unit remanufacturing cost is not constant and it may change depending on the number of recovered cores, good-part reclamation yields, and sales of remanufactured products. We present analytical results for determining an optimal solution with regard to: (i) quantity of cores to collect, (ii) end-of-life (EOL) options for the cores and (iii) product pricing of new and remanufactured products. Our analysis reveals existence of a limiting part' that dictates the number of cores to collect and a key part' that determines the number of remanufactured products to make as well as the fact that the availability of cores does not impact the EOL policy type for a product. Our analysis also enables mapping of product characteristics onto corresponding EOL policy types.

关键词： closed-loop supply chain reverse supply chain math programming production economics remanufacturing

来源：评论

学校读者我要写书评

暂无评论

Real-time container storage location assignment at a seaport container transshipment terminal: dispersion levels, yard templates, and sensitivity analyses

引用

FLEXIBLE SERVICES AND MANUFACTURING JOURNAL 2017年第3-4期29卷 369-402页

作者： Petering, Matthew E. H. Wu, Yong Li, Wenkai Goh, Mark de Souza, Robert Murty, Katta G. Univ Wisconsin Milwaukee Dept Ind & Mfg Engn Milwaukee WI 53201 USA Griffith Univ Dept Int Business & Asian Studies Gold Coast Australia Int Univ Japan Grad Sch Int Management Niigata Japan Natl Univ Singapore NUS Business Sch 1 Business Link Singapore 117592 Singapore Logist Inst Asia Pacific 21 Heng Mui Keng Terrace 04-01 Singapore 119613 Singapore Univ Michigan Dept Ind & Operat Engn Ann Arbor MI 48109 USA

We present the results of four experiments that link a seaport container terminal's overall productivity to the system that automatically selects storage locations for export containers in real time as they enter the terminal. Experiment 1 introduces the concept of a container dispersion level and tests the performance of several dispersion levels at various terminals. Experiment 2 considers the math-programming-based yard template concept that has received much attention in recent years. By evaluating yard templates under simulated operating conditions, we provide a link between yard templates and overall terminal productivity that has been absent from previous studies. Experiments 3 and 4 examine how the vessel berthing policy and yard truck traveling speed affect the performance of the storage systems considered in Experiments 1-2. The experiments provide insight into options for real-time decision making at container terminals that is rare in that (1) performance is measured in overall terms and (2) detailed measures of performance for all entities-berths, vessels, groundslots, quay cranes, yard cranes, yard trucks, and containers-involved in every container's complete lifetime at the terminal are provided.

关键词： Seaport container terminal Container storage location assignment Real-time decision making Online decision making Simulation math programming Yard template Gross crane rate

来源：评论

学校读者我要写书评

暂无评论

Optimization of the LCD optical film cutting problem

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2017年第15期55卷 4411-4435页

作者： Huang, Yeu-Shiang Wang, Shiang-An Fang, Chih-Chiang Natl Cheng Kung Univ Dept Ind & Informat Management Tainan Taiwan Shu Te Univ Dept Int Business & Trade Kaohsiung Taiwan

The manufacturing of liquid crystal display (LCD) plays an important role in electronics manufacturing industries, such as televisions, smart phones, pads, laptops, monitors and electronic appliances. Due to the fact that the cost of LCD's film materials may reach 60-70% of the production cost, appropriate cutting schemes can lead to better raw material utilisation and thus enhance manufacturers' profitability. Accordingly, the determination of the optimal production plan for cutting different-sized LCD optimal films with the designed cutting angles to fulfil the customers' orders is a critical issue for the LCD industry. In the past, few studies integrated the different cutting allocation strategies into a synthetic decision. This study proposes a mathematical programming model for the two-stage cutting problem for LCD optical films to determine the optimal cutting allocation strategy with consideration of the costs of raw materials, processing and disposal during the manufacturing process. For large-scale problems in which the runtime for obtaining the optimal solution may grow exponentially as the problem size increases, a heuristic algorithm is also provided to obtain the approximate solution within a reasonable time. Finally, the results of the practical case shows that, compared with the existing fixed-angle cutting method, the proposed approach reduces the total cost by 6.2% due to the better material utilisation. In addition, the processing cost is also reduced due to a decrease in the required materials.

关键词： production planning cost management materials management math programming optimisation cutting angle limit material

来源：评论

学校读者我要写书评

暂无评论

Scale, congestion, efficiency and effectiveness in e-commerce firms

引用

ELECTRONIC COMMERCE RESEARCH AND APPLICATIONS 2016年 20卷 171-182页

作者： Yang, Zhuofan Shi, Yong Yan, Hong Chinese Acad Sci Res Ctr Fictitious Econ & Data Sci Beijing 100190 Peoples R China Univ Chinese Acad Sci Sch Econ & Management Beijing 100190 Peoples R China Chinese Acad Sci Key Res Lab Big Data Min & Knowledge Management Beijing 100190 Peoples R China Hong Kong Polytech Univ Dept Logist & Maritime Studies Fac Business Hong Kong Hong Kong Peoples R China

This research examines what affects operations efficiency and explains the paradox of high efficiency and low profits using a two-stage analytic framework. It provides a brief overview of efficiency evaluation research for e-commerce, and establishes a set of efficiency evaluation criteria, with the application of data envelopment analysis (DEA). The results suggest that e-commerce firms suffer from input congestion. Also, scale and technology issues, as well as low economic effectiveness, lead to the overall operational inefficiency. Business-to-business (B2B) e-commerce was more efficient and effectiveness in 2014, while online-to-offline (O2O) commerce had steadier and faster growth. In general, the performance of e-commerce firms is becoming better over time. The findings of this research can help managers to improve their firms' efficiency levels by resizing their operational scale, strengthening their technology infrastructure and applications, and improving their discretionary allocation of resources. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Congestion Data envelopment analysis (DEA) E-commerce Efficiency Effectiveness math programming Production economics Returns to scale

来源：评论

学校读者我要写书评

暂无评论

Service-oriented disassembly sequence planning for electrical and electronic equipment waste

引用

Electronic Commerce Research and Applications 2016年 20卷 59-68页

作者： Xia, Kai Gao, Liang Wang, Lihui Li, Weidong Li, Xinyu Ijomah, Winifred Huazhong Univ Sci & Technol Sch Mech Sci & Engn State Key Lab Digital Mfg Equipment & Technol Wuhan 430074 Peoples R China Wuhan Second Ship Design & Res Inst Wuhan 430064 Peoples R China Royal Inst Technol Dept Prod Engn S-10044 Stockholm Sweden Coventry Univ Fac Engn & Comp Coventry CV1 5FB W Midlands England Univ Strathclyde Fac Engn Glasgow G1 1XJ Lanark Scotland

Disassembly sequence planning plays an important role in the end-of-life treatment of electrical and electronic equipment waste (e-waste). Effective planning methods can improve recovery rates and reduce environmental impacts of e-waste. In previous work, neither mathematical models nor optimization algorithms offered a satisfactory solution for this multi-objective disassembly problem. We present a multi-objective model for the problem and a modified teaching-learning-based optimization (MTLBO) algorithm to find the Pareto-optimal frontier. We use numerical simulations to demonstrate and verify the effectiveness and robustness of the algorithm. To do effective disassembly planning, all the participants in the lifecycle of e-waste should work together. Disassembly and recovery of e-waste involve complex processes across the lifecycle. Information support services, disassembly modeling and optimization services must be integrated using computer networks. We also propose a service-oriented framework to support business integration for the participants in the e-waste lifecycle. Effective and optimized disassembly planning can be achieved by invoking the related distributed services. The proposed framework is a novel e-business application for the end-of-life treatment of e-waste. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Disassembly sequence planning E-business Environmental issues math programming Multi-objective optimization Services Sustainability

来源：评论

学校读者我要写书评

暂无评论

A Scenario-Based Approach for Operating Theater Scheduling Under Uncertainty

引用

M&SOM-MANUFACTURING & SERVICE OPERATIONS MANAGEMENT 2016年第2期18卷 245-261页

作者： Freeman, Nickolas K. Melouk, Sharif H. Mittenthal, John Univ Houston Houston TX 77204 USA Univ Alabama Tuscaloosa AL 35487 USA

Elective operation scheduling significantly affects the financial health of a hospital and additional metrics important to stakeholders in an operating theater (OT) environment. In this research, we develop a novel scheduling formulation that explicitly considers the uncertainty in elective operation durations and also plans for potential randomly arriving urgent demands. Using a scenario-based modeling approach, the objective of this formulation is to maximize the expected profit associated with the OT schedule. Since the complexity of the problem is NP-hard, we develop a two-step, heuristic solution approach that allows us to solve practical sized instances in reasonable time. Experimentation shows that incorporating uncertainty via scenarios increases profit and OT utilization when compared to deterministic scheduling methods. Moreover, explicitly considering urgent arrivals results in a significant reduction in the time that patients of this type wait to receive service, with little impact on other key metrics.

关键词： healthcare management math programming

来源：评论

学校读者我要写书评

暂无评论

Improving operating room schedules

引用

HEALTH CARE MANAGEMENT SCIENCE 2016年第3期19卷 261-278页

作者： Li, Fei Gupta, Diwakar Potthoff, Sandra Univ Minnesota Ind Syst Engn Dept Minneapolis MN 55455 USA Univ Minnesota Sch Publ Hlth 420 Delaware St SE Minneapolis MN 55455 USA

Operating rooms (ORs) in US hospitals are costly to staff, generate about 70 % of a hospital's revenues, and operate at a staffed-capacity utilization of 60-70 %. Many hospitals allocate blocks of OR time to individual or groups of surgeons as guaranteed allocation, who book surgeries one at a time in their blocks. The booking procedure frequently results in unused time between surgeries. Realizing that this presents an opportunity to improve OR utilization, hospitals manually reschedule surgery start times one or two days before each day of surgical operations. The purpose of rescheduling is to decrease OR staffing costs, which are determined by the number of concurrently staffed ORs. We formulate the rescheduling problem as a variant of the bin-packing problem with interrelated items, which are the surgeries performed by the same surgeon. We develop a lower bound (LB) construction algorithm and prove that the LB is at least (2/3) of the optimal staffing cost. A key feature of our approach is that we allow hospitals to have two shift lengths. Our analytical results form the basis of a branch-and-bound algorithm, which we test on data obtained from three hospitals. Experiments show that rescheduling saves significant staffing costs.

关键词： Operating rooms Surgery scheduling Health care operations management math programming

来源：评论

学校读者我要写书评

暂无评论

Costs of Meeting Water Quality Goals under Climate Change in Urbanizing Watersheds: The Case of Difficult Run, Virginia

Costs of Meeting Water Quality Goals under Climate Change in...

引用

作者： Giuffria, Jonathon Michael Virginia Tech | University

Urban environments have been identified as a non-point source contributor of nutrient loadings into watersheds. Interannual surges of nutrient loadings into local water systems are more damaging than mean interannual nutrient loadings. Virginia has outlined the need to reduce urban nutrient loadings. Mean interannual nutrient loadings and interannual nutrient loadings variability are expected to increase under climate change (CC). However, there are few studies that provide a predictive framework for abating nutrient loadings under CC. Thus, there is a lack of information regarding how effective water quality policy will be in the future. Using the Difficult Run watershed in Fairfax County, VA, as a site of study, we used mathematical programming to compare how the costs of abating nutrient loads differed under differing climates in the Mid-Atlantic. We first compared the costs of abating mean interannual nutrient loadings in the watershed based on historical climate conditions to those predicted for CC. We then evaluated how changes in the interannual variability of nutrient loadings for CC affect the costs of meeting watershed goals. We found that abating mean interannual nutrient loadings was substantially costlier for CC relative to meeting the same goals under historical climate conditions. Further, we found that the costs of abating interannual nutrient loadings variability increased under CC relative to meeting the same goals under historical climate. One implication of this study suggests that policy makers seeking to meet water quality goals over time must front-load supplemental BMPs today in order to offset the changes predicted for CC.

关键词： Best Management Practices linear programming stormwater Climate Change nutrient loadings Chesapeake Bay cost minimization non-point source pollution built environment math programming Thesis

来源：评论

学校读者我要写书评

暂无评论

Kidney Exchange with Long Chains: An Efficient Pricing Algorithm for Clearing Barter Exchanges with Branch-and-Price

引用

M&SOM-MANUFACTURING & SERVICE OPERATIONS MANAGEMENT 2014年第4期16卷 498-512页

作者： Glorie, Kristiaan M. van de Klundert, J. Joris Wagelmans, Albert P. M. Erasmus Univ Inst Econometr NL-3000 DR Rotterdam Netherlands Erasmus Univ Inst Hlth Policy & Management NL-3000 DR Rotterdam Netherlands

Barter exchange markets are markets in which agents seek to directly trade their goods with each other. Exchanges occur in cycles or in chains in which each agent gives a good to the next agent. Kidney exchange is an important type of barter exchange market that allows incompatible patient-donor pairs to exchange kidneys so the involved patients can receive a transplant. The clearing problem is to find an allocation of donors to patients that is optimal with respect to multiple criteria. To achieve the best possible score on all criteria, long cycles and chains are often needed, particularly when there are many hard-to-match patients. In this paper we show why this may pose difficulties for existing approaches to the optimization of kidney exchanges. We then present a generic iterative branch-and-price algorithm that can deal effectively with multiple criteria, and we show how the pricing problem may be solved in polynomial time for a general class of criteria. Our algorithm is effective even for large, realistic patient-donor pools. Our approach and its effects are demonstrated by using simulations with kidney exchange data from the Netherlands and the United States.

关键词： kidney exchange multicriteria optimization math programming branch-and-price simulation

来源：评论

学校读者我要写书评

暂无评论

Clinic Capacity Management: Planning Treatment Programs that Incorporate Adherence

引用

PRODUCTION AND OPERATIONS MANAGEMENT 2014年第1期23卷 1-18页

作者： McCoy, Jessica H. Johnson, M. Eric Nike Inc North Amer Analyt Beaverton OR 97005 USA Dartmouth Coll Tuck Sch Business Hanover NH 03755 USA

For infectious diseases like tuberculosis and HIV, treatment adherence plays an important role in treatment effectiveness and epidemic control. Studies of some infectious diseases indicate that patients who live closer to their health facilities maintain higher adherence;however, most models ignore the heterogeneity of patients' adherence. Clinics must balance knowledge about adherence with epidemic growth when creating successful treatment programs. We develop an optimization model that integrates a clinic's capacity decisions with population health outcomes. We find that incorporating adherence into clinic planning models can lead to decisions that significantly improve outcomes. For example, in a realistic case study of the HIV epidemic in Zambia, we find that decision makers who ignore decreasing adherence make suboptimal decisions and overestimate the effectiveness of their treatment programs by as much as 94%. Our model is a first step toward understanding the relationship between adherence and health delivery.

关键词： health care management public policy humanitarian operations clinic capacity planning and investment math programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：