全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
Matematika  2004 

A Branch and Bound and Simulated Annealing Approach for Job Shop Scheduling

Keywords: Job shop scheduling , branch and bound , disjunctive graph formulation , simulated annealing.

Full-Text   Cite this paper   Add to My Lib

Abstract:

This paper presents two approaches to the solution of the job shop scheduling problem, namely the branch and bound, and simulated annealing approach. The objective is to schedule the jobs on the machines so that the total completion time is minimized. In the branch and bound approach, the job shop scheduling problem is represented by a disjunctive graph, then the optimal schedule is obtained using the branch and bound algorithm while simulated annealing is a local search based algorithm which will slightly perturb the initial feasible solution to decrease the makespan.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133