{"title":"Improved linear programming relaxations for flow shop problems with makespan minimization","authors":"Roderich Wallrath , Meik Franke , Matthias Walter","doi":"10.1016/j.cor.2024.106970","DOIUrl":null,"url":null,"abstract":"<div><div>Machine scheduling problems with makespan minimization have been addressed in various academic and industrial fields using mixed-integer programming (MIP). In most MIP models, however, the makespan variable is poorly linked to the natural date variables of jobs. To address this, we propose novel, strengthening inequalities, derived from the single-machine scheduling polyhedron augmented by a makespan variable. While the associated optimization problem for a single machine is trivial, these inequalities can be applied as cutting planes to more complicated scheduling problems. In this work, we demonstrate their use for non-permutation flow shops. Using the Taillard benchmark set, we analyze the effect of the inequalities on the linear programming relaxations and mixed-integer programs of three commonly used MIP models. The experiments show that the inequalities significantly improve the ability of linear-ordering and time-indexed models to bound the optimum. The positive effect also extends to linear-ordering models with changeover times, demonstrating the potential of these inequalities to improve more general, application-oriented flow shop problems.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"177 ","pages":"Article 106970"},"PeriodicalIF":4.1000,"publicationDate":"2025-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054824004428","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
Machine scheduling problems with makespan minimization have been addressed in various academic and industrial fields using mixed-integer programming (MIP). In most MIP models, however, the makespan variable is poorly linked to the natural date variables of jobs. To address this, we propose novel, strengthening inequalities, derived from the single-machine scheduling polyhedron augmented by a makespan variable. While the associated optimization problem for a single machine is trivial, these inequalities can be applied as cutting planes to more complicated scheduling problems. In this work, we demonstrate their use for non-permutation flow shops. Using the Taillard benchmark set, we analyze the effect of the inequalities on the linear programming relaxations and mixed-integer programs of three commonly used MIP models. The experiments show that the inequalities significantly improve the ability of linear-ordering and time-indexed models to bound the optimum. The positive effect also extends to linear-ordering models with changeover times, demonstrating the potential of these inequalities to improve more general, application-oriented flow shop problems.
期刊介绍:
Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.