{"title":"具有多机容量和关键工序排序的双向流水车间调度","authors":"Z. Zhao, T. Leong, S. Ge, H. Lau","doi":"10.1109/ISIC.2007.4450927","DOIUrl":null,"url":null,"abstract":"We study a special bidirectional flow shop problem with multi-machine capacity and sequencing constraints on critical operations. A formulation is proposed in continuous time domain and compared with a mixed integer programming (MIP) formulation in discrete time domain. Of particular interest to us is the formulation of the machine utilization function -both in continuous time and in discrete time domain. Fast heuristics are proposed with the relaxation of the machine capacity. The performance of the heuristic and Lagrangian relaxation are compared with optimal solutions experimentally.","PeriodicalId":184867,"journal":{"name":"2007 IEEE 22nd International Symposium on Intelligent Control","volume":"114 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Bidirectional Flow Shop Scheduling with Multi-Machine Capacity and Critical Operation Sequencing\",\"authors\":\"Z. Zhao, T. Leong, S. Ge, H. Lau\",\"doi\":\"10.1109/ISIC.2007.4450927\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study a special bidirectional flow shop problem with multi-machine capacity and sequencing constraints on critical operations. A formulation is proposed in continuous time domain and compared with a mixed integer programming (MIP) formulation in discrete time domain. Of particular interest to us is the formulation of the machine utilization function -both in continuous time and in discrete time domain. Fast heuristics are proposed with the relaxation of the machine capacity. The performance of the heuristic and Lagrangian relaxation are compared with optimal solutions experimentally.\",\"PeriodicalId\":184867,\"journal\":{\"name\":\"2007 IEEE 22nd International Symposium on Intelligent Control\",\"volume\":\"114 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE 22nd International Symposium on Intelligent Control\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIC.2007.4450927\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE 22nd International Symposium on Intelligent Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIC.2007.4450927","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Bidirectional Flow Shop Scheduling with Multi-Machine Capacity and Critical Operation Sequencing
We study a special bidirectional flow shop problem with multi-machine capacity and sequencing constraints on critical operations. A formulation is proposed in continuous time domain and compared with a mixed integer programming (MIP) formulation in discrete time domain. Of particular interest to us is the formulation of the machine utilization function -both in continuous time and in discrete time domain. Fast heuristics are proposed with the relaxation of the machine capacity. The performance of the heuristic and Lagrangian relaxation are compared with optimal solutions experimentally.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
