A multistage graph-based procedure for solving a just-in-time flexible job-shop scheduling problem with machine and time-dependent processing costs
研究了一个新的柔性作业车间调度问题，目标是最小化工件的提前和延迟成本以及操作成本（后者取决于机器和时间段），提出了一种基于多阶段图的最短路径启发式方法，并通过实验验证了效果。
This paper deals with a new flexible job-shop scheduling problem in which the objective function to be minimised is the sum of the earliness and tardiness costs of the jobs and the costs of the operations required to perform the jobs, the latter depending on the machine and the time interval in which they are performed (as happens in many countries with the costs of electric power or those of manpower). We formalise the problem with a mathematical model and we propose a heuristic procedure that is based primarily on constructing a multistage graph and finding in it the shortest path from the source to the sink. We also describe the generation of the data-set used in an extensive computational experiment and expose and analyse the obtained results.