{"title":"一种有效的方法,用于最大限度地缩短包络流程车间中的总完成时间,同时又受到工期限制","authors":"E. Pastore, A. Alfieri","doi":"10.1080/0305215x.2024.2302909","DOIUrl":null,"url":null,"abstract":"This article addresses the permutation flowshop scheduling problem with the objective of minimizing the total completion time subject to a makespan constraint. The makespan is related to system uti...","PeriodicalId":50521,"journal":{"name":"Engineering Optimization","volume":"57 1","pages":""},"PeriodicalIF":2.2000,"publicationDate":"2024-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An effective approach for total completion time minimization subject to makespan constraint in permutation flowshops\",\"authors\":\"E. Pastore, A. Alfieri\",\"doi\":\"10.1080/0305215x.2024.2302909\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article addresses the permutation flowshop scheduling problem with the objective of minimizing the total completion time subject to a makespan constraint. The makespan is related to system uti...\",\"PeriodicalId\":50521,\"journal\":{\"name\":\"Engineering Optimization\",\"volume\":\"57 1\",\"pages\":\"\"},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2024-02-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Engineering Optimization\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.1080/0305215x.2024.2302909\",\"RegionNum\":3,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"ENGINEERING, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Engineering Optimization","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1080/0305215x.2024.2302909","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
An effective approach for total completion time minimization subject to makespan constraint in permutation flowshops
This article addresses the permutation flowshop scheduling problem with the objective of minimizing the total completion time subject to a makespan constraint. The makespan is related to system uti...
期刊介绍:
Engineering Optimization is an interdisciplinary engineering journal which serves the large technical community concerned with quantitative computational methods of optimization, and their application to engineering planning, design, manufacture and operational processes. The policy of the journal treats optimization as any formalized numerical process for improvement. Algorithms for numerical optimization are therefore mainstream for the journal, but equally welcome are papers which use the methods of operations research, decision support, statistical decision theory, systems theory, logical inference, knowledge-based systems, artificial intelligence, information theory and processing, and all methods which can be used in the quantitative modelling of the decision-making process.
Innovation in optimization is an essential attribute of all papers but engineering applicability is equally vital. Engineering Optimization aims to cover all disciplines within the engineering community though its main focus is in the areas of environmental, civil, mechanical, aerospace and manufacturing engineering. Papers on both research aspects and practical industrial implementations are welcomed.