Non-permutation flow shop scheduling with order acceptance and weighted tardiness》.pdfVIP

Applied Mathematics and Computation 270 (2015) 312–333 Contents lists available at ScienceDirect Applied Mathematics and Computation journal homepage: /locate/amc Non-permutation flow shop scheduling with order acceptance and weighted tardiness a b c,∗ d Yiyong Xiao , Yingying Yuan , Ren-Qian Zhang , Abdullah Konak a School of Reliability and System Engineering, Beihang University, Beijing 100191, China b CSR Zhuzhou Locomotive Research Institute Co., Ltd., Zhuzhou City, Hunan Province 412001, China c School of Economics and Management, Beihang University, Beijing 100191, China d Information Sciences and Technology, Penn State Berks, Tulpehocken Road, P.O. Box 7009, Reading, PA 19610-6009, United States a r t i c l e i n f o a b s t r a c t Keywords: This paper studies the non-permutation solution for the problem of flow shop scheduling with Flow shop scheduling order acceptance and weighted tardiness (FSS-OAWT). We formulate the problem as a linear Order acceptance mixed integer programming (LMIP) model that can be optimally solved by AMPL/CPLEX for Weighted tardiness small-sized problems. In addition, a non-linear integer programming (NIP) model is presented Genetic algorithm to design heuristic algorithms. A two-phase genetic algorithm (TP-GA) is developed to solve the problem of medium and large sizes based on