Abstract
The paper studies the single-machine scheduling problem with sequence-dependent setup times under dynamic environment. In this problem, jobs arrive over time and all the information on a job is unknown in advance. The objective is to find a feasible schedule such that the maximum lateness is minimised. This problem represents a very important production scheduling problem but remains under-represented in the literature. To solve the problem, we propose a dynamic differential evolution algorithm that considers the new environment and the previous environment simultaneously. The performance of the algorithm is enhanced by two heuristics for generating efficient initial solutions, a local search procedure and a speed-up method. To evaluate its performance, the proposed algorithm is tested on 1000 instances from the literature. The computational results demonstrate that the proposed algorithm is highly effective as compared to the methods known from the literature.
Funding Information
  • National Natural Science Foundation of China (71202151)
  • National 863 High-Tech Research and Development Program of China (2013AA040704)
  • State Key Laboratory of Synthetical Automation for Process Industries Fundamental Research Funds (2013ZCX02)

This publication has 42 references indexed in Scilit: