%0 Journal Article %1 JNW3920 %A Jie, Bai %A Kai, Sun %A Ke, Yang %D 2011 %J Journal of Networks %K *file-import-12-02-17 annealing, cost, job-shop, optimization, problem, scatter, scheduling, search, simulated, %N 7 %T Mathematical Model and Hybrid Scatter Search for Cost Driven Job-shop Scheduling Problem %U http://ojs.academypublisher.com/index.php/jnw/article/view/jnw0607974981 %V 6 %X Job-shop scheduling problem (JSP) is one of the most well-known machine scheduling problems and one of the strongly NP-hard combinatorial optimization problems. Cost optimization is an attractive and critical research and development area for both academic and industrial societies. This paper presents a cost driven model of the job-shop scheduling problem in which the solutions are driven by business inputs, such as the cost of the product transitions, revenue loss due to the machine idle time and earliness/tardiness penalty. And then, a new hybrid scatter search algorithm is proposed to solve the cost driven job-shop scheduling problem by introducing the simulated annealing (SA) into the improvement method of scatter search (SS). In order to illustrate the effectiveness of the hybrid method, some test problems are generated, and the performance of the proposed method is compared with other evolutionary algorithms such as genetic algorithm and simulated annealing. The experimental simulation tests show that the hybrid method is quite effective at solving the cost driven job-shop scheduling problem.

@article{JNW3920, abstract = {{Job-shop scheduling problem (JSP) is one of the most well-known machine scheduling problems and one of the strongly NP-hard combinatorial optimization problems. Cost optimization is an attractive and critical research and development area for both academic and industrial societies. This paper presents a cost driven model of the job-shop scheduling problem in which the solutions are driven by business inputs, such as the cost of the product transitions, revenue loss due to the machine idle time and earliness/tardiness penalty. And then, a new hybrid scatter search algorithm is proposed to solve the cost driven job-shop scheduling problem by introducing the simulated annealing (SA) into the improvement method of scatter search (SS). In order to illustrate the effectiveness of the hybrid method, some test problems are generated, and the performance of the proposed method is compared with other evolutionary algorithms such as genetic algorithm and simulated annealing. The experimental simulation tests show that the hybrid method is quite effective at solving the cost driven job-shop scheduling problem.}}, added-at = {2012-03-02T03:39:18.000+0100}, author = {Jie, Bai and Kai, Sun and Ke, Yang}, biburl = {https://www.bibsonomy.org/bibtex/25e9bd45d4e4b7f6f923f8a21e2cd0828/baby9992006}, citeulike-article-id = {10361249}, citeulike-linkout-0 = {http://ojs.academypublisher.com/index.php/jnw/article/view/jnw0607974981}, interhash = {4beed894edd5fde9f07c0d81730b9513}, intrahash = {5e9bd45d4e4b7f6f923f8a21e2cd0828}, journal = {Journal of Networks}, keywords = {*file-import-12-02-17 annealing, cost, job-shop, optimization, problem, scatter, scheduling, search, simulated,}, number = 7, posted-at = {2012-02-17 09:46:30}, priority = {2}, timestamp = {2012-03-02T03:39:22.000+0100}, title = {{Mathematical Model and Hybrid Scatter Search for Cost Driven Job-shop Scheduling Problem}}, url = {http://ojs.academypublisher.com/index.php/jnw/article/view/jnw0607974981}, volume = 6, year = 2011 }