Huang, Min; Fu, Yaping; Wang, Hongfeng; Zhu, Binghu; Wang, Xingwei A job-shop scheduling model and its algorithm with machine deterioration. (Chinese. English summary) Zbl 1340.90087 Acta Autom. Sin. 41, No. 3, 551-558 (2015). Summary: For the job-shop scheduling problem, a job-shop scheduling model with machine deterioration is built in order to minimize makespan, considering that the processing time of jobs is a linearly increasing function of the start time. Then a nested partition method is designed for solving it. In the sampling process, the partheno-genetic algorithm is embedded into the nested partition method in order to ensure the diversity of sampling and quality. Simulation experiments show that the proposed algorithm for solving job-shop scheduling problems with machine deterioration can get higher quality solutions and has a better robustness. MSC: 90B35 Deterministic scheduling theory in operations research 90C59 Approximation methods and heuristics in mathematical programming 90B25 Reliability, availability, maintenance, inspection in operations research Keywords:nested partition method; partheno-genetic algorithm; job shop; scheduling problem PDFBibTeX XMLCite \textit{M. Huang} et al., Acta Autom. Sin. 41, No. 3, 551--558 (2015; Zbl 1340.90087) Full Text: DOI