Please use this identifier to cite or link to this item:
|Title:||A Two-Machine Flowshop Scheduling Problem with a Job Precedence Constraint to Minimize the Total Completion Time|
|Keywords:||Scheduling;Simulated Annealing;Largest Order Value Method;Job Precedence|
|Abstract:||In this study we address a two-machine flowshop scheduling problem with a job constraint. The objective function is to find a sequence to minimize the total completion time, which means that a schedule’s cost, is directly related to the average time it takes to process a single job. Due to the higher complexity of proposed problem, we use a branch-and-bound method incorporating with several dominance rules and lower bounds for finding an optimal solution. We then propose a simulated annealing and a largest order value method for finding a near-optimal solution. In addition, we test the performances of all the proposed algorithms for the small and big numbers of jobs.|
|ISSN:||0975-1084 (Online); 0022-4456 (Print)|
|Appears in Collections:||JSIR Vol.76(12) [December 2017]|
Items in NOPR are protected by copyright, with all rights reserved, unless otherwise indicated.