期刊
EXPERT SYSTEMS WITH APPLICATIONS
卷 38, 期 7, 页码 7911-7918出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2010.10.066
关键词
Just-in-time scheduling; Single machine; Preemption; Machine idle time; Genetic algorithm
This paper concerns with the concept of preemption in just-in-time single machine scheduling problem, with allowable machine idle time. We proposed a new model, with non-linear terms and integer variables which cannot be solved efficiently for large size problems due to its NP-hardness. To solve the model for real size applications, genetic algorithm is applied. These genetic procedures are also quite close to the optimum and provided an optimal solution for most of the test problems. Numerical examples show that the proposed algorithm is efficient and effective. (C) 2010 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据