A reduced variable neighborhood search for the just in time job shop scheduling problem with sequence dependent setup times
研究了带顺序相关准备时间和释放日期的准时制作业车间调度问题，目标是最小化提前、延迟和流动时间的加权和，提出了一种基于问题结构的新破坏与修复算子，并嵌入简化变邻域搜索元启发式算法，实验表明该算法优于现有方法。
In this paper, we deal with the just-in-time job shop scheduling problem with sequence-dependent setup times and release dates. Given a set of jobs characterized by release and due dates, the goal is to execute them by minimizing a weighted sum of their earliness, tardiness, and flow time (i.e., the difference between completion and start time of each job). We develop new destroy and repair operators by exploiting the structure of the problem, and we use them within a reduced variable neighborhood search matheuristic. Computational experiments carried out on several sets of instances show that the proposed algorithm outperforms existing solution methods.