Optimization of Job Shop Scheduling Problem using Tabu Search Optimization Technique
The Job shop scheduling (JSS) problem consists of „n‟ jobs and „m
Articles, journals and conferences in one search. An exact title, DOI or ISSN is listed first.
In the search box: "exact phrase" · -leave out · OR · prefix* · title: author: journal:
The Job shop scheduling (JSS) problem consists of „n‟ jobs and „m
For authors and organisers
Find the right journal for your paper and submit your manuscript.