期刊
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
卷 70, 期 4, 页码 620-633出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/01605682.2018.1452537
关键词
Scheduling; flexible job-shop problem; just-in-time; heuristics
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据