{"title":"增材制造单机调度的分支价格算法","authors":"Lindong Liu, Zhenyu Wu, Yugang Yu","doi":"10.1016/j.jmse.2022.10.001","DOIUrl":null,"url":null,"abstract":"<div><p>Additive manufacturing (AM) has attracted significant attention in recent years based on its wide range of applications and growing demand. AM offers the advantages of production flexibility and design freedom. In this study, we considered a practical variant of the batch-processing-machine (BPM) scheduling problem that arises in AM industries, where an AM machine can process multiple parts simultaneously, as long as the two-dimensional rectangular packing constraint is not violated. Based on the set-partitioning formulation of our mixed-integer programming (MIP) model, a branch-and-price (B&P) algorithm was developed by embedding a column-generation technique into a branch-and-bound framework. Additionally, a novel labelling algorithm was developed to accelerate the column-generation process. Ours is the first study to provide a B&P algorithm to solve the BPM scheduling problem in the AM industry. We tested the performance of our algorithm using a modern MIP solver (Gurobi) and real data from a 3D printing factory. The results demonstrate that for most instances tested, our algorithm produces results similar or identical to those of Gurobi with reasonable computation time and outperforms Gurobi in terms of solution quality and running time on some large instances.</p></div>","PeriodicalId":36172,"journal":{"name":"Journal of Management Science and Engineering","volume":"8 2","pages":"Pages 273-286"},"PeriodicalIF":5.4000,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A branch-and-price algorithm to perform single-machine scheduling for additive manufacturing\",\"authors\":\"Lindong Liu, Zhenyu Wu, Yugang Yu\",\"doi\":\"10.1016/j.jmse.2022.10.001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Additive manufacturing (AM) has attracted significant attention in recent years based on its wide range of applications and growing demand. AM offers the advantages of production flexibility and design freedom. In this study, we considered a practical variant of the batch-processing-machine (BPM) scheduling problem that arises in AM industries, where an AM machine can process multiple parts simultaneously, as long as the two-dimensional rectangular packing constraint is not violated. Based on the set-partitioning formulation of our mixed-integer programming (MIP) model, a branch-and-price (B&P) algorithm was developed by embedding a column-generation technique into a branch-and-bound framework. Additionally, a novel labelling algorithm was developed to accelerate the column-generation process. Ours is the first study to provide a B&P algorithm to solve the BPM scheduling problem in the AM industry. We tested the performance of our algorithm using a modern MIP solver (Gurobi) and real data from a 3D printing factory. The results demonstrate that for most instances tested, our algorithm produces results similar or identical to those of Gurobi with reasonable computation time and outperforms Gurobi in terms of solution quality and running time on some large instances.</p></div>\",\"PeriodicalId\":36172,\"journal\":{\"name\":\"Journal of Management Science and Engineering\",\"volume\":\"8 2\",\"pages\":\"Pages 273-286\"},\"PeriodicalIF\":5.4000,\"publicationDate\":\"2023-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Management Science and Engineering\",\"FirstCategoryId\":\"96\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S209623202200052X\",\"RegionNum\":2,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"BUSINESS, FINANCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Management Science and Engineering","FirstCategoryId":"96","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S209623202200052X","RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"BUSINESS, FINANCE","Score":null,"Total":0}
A branch-and-price algorithm to perform single-machine scheduling for additive manufacturing
Additive manufacturing (AM) has attracted significant attention in recent years based on its wide range of applications and growing demand. AM offers the advantages of production flexibility and design freedom. In this study, we considered a practical variant of the batch-processing-machine (BPM) scheduling problem that arises in AM industries, where an AM machine can process multiple parts simultaneously, as long as the two-dimensional rectangular packing constraint is not violated. Based on the set-partitioning formulation of our mixed-integer programming (MIP) model, a branch-and-price (B&P) algorithm was developed by embedding a column-generation technique into a branch-and-bound framework. Additionally, a novel labelling algorithm was developed to accelerate the column-generation process. Ours is the first study to provide a B&P algorithm to solve the BPM scheduling problem in the AM industry. We tested the performance of our algorithm using a modern MIP solver (Gurobi) and real data from a 3D printing factory. The results demonstrate that for most instances tested, our algorithm produces results similar or identical to those of Gurobi with reasonable computation time and outperforms Gurobi in terms of solution quality and running time on some large instances.
期刊介绍:
The Journal of Engineering and Applied Science (JEAS) is the official journal of the Faculty of Engineering, Cairo University (CUFE), Egypt, established in 1816.
The Journal of Engineering and Applied Science publishes fundamental and applied research articles and reviews spanning different areas of engineering disciplines, applications, and interdisciplinary topics.