IF 1.3 4区计算机科学

Infor Pub Date : 2020-07-20 DOI: 10.1080/03155986.2020.1785263

P. Orenstein

{"title":"The changing landscape of supply chain networks: an empirical analysis of topological structure","authors":"P. Orenstein","doi":"10.1080/03155986.2020.1785263","DOIUrl":"https://doi.org/10.1080/03155986.2020.1785263","url":null,"abstract":"Abstract Supply chain networks are complex and often proprietary, which implies that on the most part, the structure of a company’s supply chain is not well known nor accessible. This research investigates supply chain network topology, properties and supply network evolution using a data-driven approach. The key idea is to construct a sample set of data from a financial source and examine it in the context of supply network topology. This represents a new direction, since, while financial data has been applied by researchers to explore financial relationships in a supply chain, the application of this data source to determine the underlying topological characteristics is still in its infancy. As a starting point, we create a sample of supply networks from the retail industry sector (two from home improvement industry and one from the sporting goods industry). We expect that the retail industry will provide a rich and dynamic source of representative data for a typical supply chain network. We use the sample data sets to identify specific topological characteristics (for example, average degree, network diameter, average path length, and degree exponent) which help explain the evolution and dynamics of a modern supply network. Using these identified characteristics, our plan is to expand the selection to cover additional networks over a wider time-span in order to generalize the findings.","PeriodicalId":13645,"journal":{"name":"Infor","volume":"32 1","pages":"53 - 73"},"PeriodicalIF":1.3,"publicationDate":"2020-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82702102","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem: a robust optimization approach 动态设施布局问题的混合嵌套分区和模拟退火算法:一种鲁棒优化方法

IF 1.3 4区计算机科学

Infor Pub Date : 2020-07-06 DOI: 10.1080/03155986.2020.1788328

Leila Khajemahalle, S. Emami, R. N. Keshteli

{"title":"A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem: a robust optimization approach","authors":"Leila Khajemahalle, S. Emami, R. N. Keshteli","doi":"10.1080/03155986.2020.1788328","DOIUrl":"https://doi.org/10.1080/03155986.2020.1788328","url":null,"abstract":"Abstract The dynamic facility layout problem (DFLP) deals with the arrangement of facilities/departments in a factory for different periods so that the location of the facilities can be changed from one period to another one. Traditionally, this problem is formulated to minimize the sum of material handling and rearrangement costs in the planning horizon by assuming that all parameters are deterministic. In this paper, we assume that the material flow between departments and rearrangement costs are uncertain and, accordingly, develop the robust counterpart (RC) of the DFLP model. The model is computationally intractable; therefore, we propose a hybrid algorithm based on nested partitions (NP) and simulated annealing (SA) algorithms, namely NP-SA. Moreover, we develop a heuristic algorithm to compute the values of the additional variables used in the RC model. The numerical results indicate that the NP-SA algorithm is very effective in giving a good solution in a short time. Furthermore, a simulation study demonstrates that, on average, robust solutions are better than nominal solutions.","PeriodicalId":13645,"journal":{"name":"Infor","volume":"13 1","pages":"74 - 101"},"PeriodicalIF":1.3,"publicationDate":"2020-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89016041","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Optimum workforce scheduling for multiple security gates 多个安全闸门的最佳人力调度

IF 1.3 4区计算机科学

Infor Pub Date : 2020-07-02 DOI: 10.1080/03155986.2019.1629770

Hesham K. Alfares, A. Alzahrani

引用次数: 3

Manufacturer rebate in green supply chain with information asymmetry 信息不对称下的绿色供应链制造商返利

IF 1.3 4区计算机科学

Infor Pub Date : 2020-05-19 DOI: 10.1080/03155986.2020.1761093

Zhibing Lin

引用次数: 7

Estimation of fuzzy portfolio efficiency via an improved DEA approach 基于改进DEA方法的模糊投资组合效率估计

IF 1.3 4区计算机科学

Infor Pub Date : 2020-05-14 DOI: 10.1080/03155986.2020.1734904

Helu Xiao, Tiantian Ren, Teng Ren

引用次数: 8

Strategy analysis of the producer considering product design and collection effort under take-back legislation 考虑回收法规下产品设计和回收努力的生产者策略分析

IF 1.3 4区计算机科学

Infor Pub Date : 2020-05-07 DOI: 10.1080/03155986.2020.1756179

Bang-yi Li, Yuyu Chen, Guoqing Zhang, Qingguo Bai

{"title":"Strategy analysis of the producer considering product design and collection effort under take-back legislation","authors":"Bang-yi Li, Yuyu Chen, Guoqing Zhang, Qingguo Bai","doi":"10.1080/03155986.2020.1756179","DOIUrl":"https://doi.org/10.1080/03155986.2020.1756179","url":null,"abstract":"Abstract To reduce the environmental pollution of Waste Electrical and Electronic Equipment (WEEE), the government has promulgated take-back legislation. For the producer, he should consider collection effort and remanufacturing design response to collection goal and remanufacturing goal. In this article, we develop two models: (1) model only with remanufacturing design and (2) model with both collection effort and remanufacturing design. First, we study how the producer chooses the optimal strategy based on the parameters of the product design and collection effort in the two models. By comparing the two models, the main conclusions are as follows: (i) we obtain the impact of collection effort on government legislation; (ii) the quantities of new product, remanufactured product, collection amount, remanufacturing design level, collection effort level, profit of the producer, and environmental impact increase as a result of collection effort investment; and (iii) when the economic value of unit environmental impact is low, the social welfare in the case with collection effort investment is higher than that without collection effort investment.","PeriodicalId":13645,"journal":{"name":"Infor","volume":"8 1","pages":"703 - 722"},"PeriodicalIF":1.3,"publicationDate":"2020-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76079896","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Closed loop supply chain network design under uncertain price-sensitive demand and return 不确定价格敏感需求与回报下的闭环供应链网络设计

IF 1.3 4区计算机科学

Infor Pub Date : 2020-04-16 DOI: 10.1080/03155986.2020.1738154

A. Farshbaf-Geranmayeh, A. T. Moghadam, S. Torabi

引用次数: 5

Product diversification decisions considering quality reliability and self-competition in a global supply chain 在全球供应链中考虑质量可靠性和自我竞争的产品多样化决策

IF 1.3 4区计算机科学

Infor Pub Date : 2020-04-16 DOI: 10.1080/03155986.2020.1746556

Baozhuang Niu, Dilang Wu, Zihao Mu

{"title":"Product diversification decisions considering quality reliability and self-competition in a global supply chain","authors":"Baozhuang Niu, Dilang Wu, Zihao Mu","doi":"10.1080/03155986.2020.1746556","DOIUrl":"https://doi.org/10.1080/03155986.2020.1746556","url":null,"abstract":"Abstract Sourcing overseas enables customers to experience high-quality products, especially for those in the developing countries/regions. This induces many brand-owners to decide product diversification by selling both imported products (high quality reliability) and local products (low quality reliability), although product self-competition occurs and may result in system profit loss. In this paper, we consider a global supply chain comprising of a brand-owner, a local supplier, and an overseas supplier to investigate the brand-owner’s strategic decisions of product diversification when the quality levels of both the imported product and the local product are not always reliable. We identify three interactive effects regarding the wholesale prices, the order quantities, and the quality levels. Interestingly, we find that, when the quality reliability of the imported product is in a moderate range, the brand-owner is only incentivized to decide product diversification given intense self-competition. We also find that the brand-owner’s total demand size of the products is first decreasing then increasing in the competition intensity.","PeriodicalId":13645,"journal":{"name":"Infor","volume":"28 1","pages":"680 - 702"},"PeriodicalIF":1.3,"publicationDate":"2020-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74898842","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

On the identification of the optimal partition for semidefinite optimization 半定优化中最优分区的辨识

IF 1.3 4区计算机科学

Infor Pub Date : 2020-04-02 DOI: 10.1080/03155986.2019.1572853

Ali Mohammad Nezhad, T. Terlaky

{"title":"On the identification of the optimal partition for semidefinite optimization","authors":"Ali Mohammad Nezhad, T. Terlaky","doi":"10.1080/03155986.2019.1572853","DOIUrl":"https://doi.org/10.1080/03155986.2019.1572853","url":null,"abstract":"Abstract The concept of the optimal partition was originally introduced for linear optimization and linear complementarity problems and subsequently extended to semidefinite optimization. For linear optimization and sufficient linear complementarity problems, from a central solution sufficiently close to the optimal set, the optimal partition and a maximally complementary optimal solution can be identified in strongly polynomial time. In this paper, we consider the identification of the optimal partition of semidefinite optimization, for which we provide an approximation from a bounded sequence of solutions on, or in a neighborhood of the central path. Using bounds on the magnitude of the eigenvalues, we identify the subsets of eigenvectors of the interior solutions whose accumulation points are orthonormal bases for the subspaces of the optimal partition. The magnitude of the eigenvalues of an interior solution is quantified using a condition number and an upper bound on the distance of an interior solution to the optimal set. We provide a measure of proximity of the approximation obtained from the central solutions to the true optimal partition of the problem.","PeriodicalId":13645,"journal":{"name":"Infor","volume":"1 1","pages":"225 - 263"},"PeriodicalIF":1.3,"publicationDate":"2020-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91237834","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 12

A Unified Efficient Implementation of Trust-region Type Algorithms for Unconstrained Optimization 无约束优化信赖域型算法的统一高效实现

IF 1.3 4区计算机科学

Infor Pub Date : 2020-04-02 DOI: 10.1080/03155986.2019.1624490

J. Dussault

引用次数: 2

Infor最新文献