Loading...
Search for:
number-of-tardy-jobs
0.004 seconds
Sequence-dependent flow shop scheduling problem minimising the number of tardy jobs
, Article International Journal of Production Research ; Volume 50, Issue 20 , 2012 , Pages 5843-5858 ; 00207543 (ISSN) ; Salmasi, N ; Sharif University of Technology
2012
Abstract
Flow shop scheduling problems with sequence-dependent setup times and minimising the number of tardy jobs as the criterion (F m |prmu, S ijk |∑U j) are considered in this research. A mixed-integer linear programming model is developed for the research problem. Since the proposed research problem has been proven to be NP-hard, several meta-heuristic algorithms based on tabu search (TS) and the imperialist competitive algorithm (ICA) are proposed to heuristically solve the problem. In order to find the best meta-heuristic algorithm, random test problems, ranging in size from small, medium, to large, are generated and solved by the meta-heuristic algorithms. Then, a detailed statistical...
Minimizing the number of tardy jobs in flow shop sequence dependent setup times scheduling problem
, Article Applied Mechanics and Materials ; Volume 110-116 , 2012 , Pages 4063-4069 ; 16609336 (ISSN) ; 9783037852620 (ISBN) ; Salmasi, N ; Sharif University of Technology
2012
Abstract
This paper investigates permutation flow shop scheduling problems with sequencedependent setup times with minimizing the number of tardy jobs as criterion (F m|prmu, S ijk|σU j). Since the proposed research problem has been proven to be NP-hard, three different meta heuristic algorithms based on tabu search (TS) has been proposed to solve the problem. These three algorithms are different based on their tabu list characteristics. In order to evaluate the performance of the proposed TS algorithms, test problems in different ranges are generated to find the best algorithm. The comparison shows that the TS algorithm which its tabu list keeps track of the slots that the jobs are assigned has a...
Minimizing the Number of Tardy Jobs in Flow Shop Sequence Dependent Setup Times Scheduling Problem
, M.Sc. Thesis Sharif University of Technology ; Salmasi, Nasser (Supervisor)
Abstract
This research investigates permutation flow shop scheduling problems with sequence-dependent setup times with minimizing the number of tardy jobs as criterion (Fm|prmu, Sijk|ΣUj). A mixed integer linear programming model has been developed for the research problem. As the problem is shown to be NP-hard, several meta-heuristic algorithms based on tabu search (TS) and imperialist competitive algorithm are developed to heuristically solve the problem. In order to find the best meta-heuristic algorithm, random test problems, ranging in size from small, medium, to large are created and solved by the meta-heuristic algorithms. Then, a detailed statistical experiment, based on split-plot design is...