Loading...
Search for:
flowshop
0.005 seconds
Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem
, Article Annals of Operations Research ; Volume 226, Issue 1 , March , 2014 , pp. 351-377 ; ISSN: 02545330 ; Salmasi, N ; Varmazyar, M ; Sharif University of Technology
Abstract
This research considers a flexible flowshop sequence-dependent group scheduling problem with minimization of total completion time. A mixed integer linear mathematical model for the research problem is developed. Since the research problem is shown to be strongly NP-hard, a metaheuristic algorithm based on memetic algorithm (MA) is proposed. A lower bounding method based on the Branch and Price algorithm is also proposed to evaluate the quality of the MA. In order to evaluate the performance of the proposed algorithms, random test problems, ranging in size from small, medium, to large are generated and solved by the MA and the lower bounding method. The results show that the average...
Makespan minimisation in flexible flowshop sequence-dependent group scheduling problem
, Article International Journal of Production Research ; Volume 51, Issue 20 , 2013 , Pages 6182-6193 ; 00207543 (ISSN) ; Salmasi, N ; Sharif University of Technology
2013
Abstract
In this research, the flexible flowshop sequence-dependent group scheduling problem with minimisation of makespan as the criterion (FFm|fmls, shgi|Cmax) is investigated. A mixed integer linear mathematical model for the research problem is developed. Since the research problem is shown to be NP-hard, a meta-heuristic algorithm based on memetic algorithm (MA) is developed to efficiently solve the problem. Also, a lower bounding technique based on the developed mathematical model is proposed to evaluate the quality of the proposed MA. The performance of the proposed MA is compared with the existing algorithm in the literature, i.e. tabu search (TS), by solving the available test problems in...
Bicriteria two-machine flowshop scheduling using metaheuristics
, Article 9th Annual Genetic and Evolutionary Computation Conference, GECCO 2007, London, 7 July 2007 through 11 July 2007 ; 2007 , Pages 909- ; 9781595936974 (ISBN) ; Hendizadeh, S. H ; Salmasi, N ; Sharif University of Technology
2007
Abstract
A bicriteria two-machine flowshop scheduling problem is addressed to minimize the number of setups and makespan. The jobs have sequence dependent setup times. Scheduling problems considering either of these objectives are NP-hard. Two multi-objective metaheurisctics based on genetic algorithms (MOGA) and simulated annealing (MOSA) are proposed to find approximations of Pareto-optimal frontiers. The performances of these approaches are compared with lower bounds for small problems. In larger problems, their performance is compared with each other. Experimentations revealed that both algorithms perform very similar on small problems and that MOGA outperforms MOSA in terms of the quality of...
Flowshop-scheduling problems with makespan criterion: A review
, Article International Journal of Production Research ; Volume 43, Issue 14 , 2005 , Pages 2895-2929 ; 00207543 (ISSN) ; Saghafian, S ; Sharif University of Technology
2005
Abstract
This paper is a complete survey of flowshop-scheduling problems and contributions from early works of Johnson of 1954 to recent approaches of metaheuristics of 2004. It mainly considers a flowshop problem with a makespan criterion and it surveys some exact methods (for small size problems), constructive heuristics and developed improving metaheuristic and evolutionary approaches as well as some well-known properties and rules for this problem. Each part has a brief literature review of the contributions and a glimpse of that approach before discussing the implementation for a flowshop problem. Moreover, in the first section, a complete literature review of flowshop-related scheduling...
Optimizing a Flowshop Model with the Objective of Minimizing Total Weighted Tardiness while Considering due Dates on All Machines
, M.Sc. Thesis Sharif University of Technology ; Ghassemi Tari, Farhad (Supervisor)
Abstract
Minimizing completion time of tasks in a flowshops has always attracted attention of researchers since it was introduced by Johnson, 1954. If all jobs are processed in the same order, the sequence is called a permutation sequence. Tardiness factor is one of important factors in permutation flowshop sequencing problem. Minimizing this factor brings about increase in service level of the shop and is helpful in meeting customer’s needs. Since, minimizing tardiness in PFSP in among NP-hard problems, computational efforts in this area has focused on heuristic approaches. However, the researches has always considered due dates only on the last machine. It means, always it has been assumed that due...
Minimization of weighted earliness and tardiness for no-wait sequence-dependent setup times flowshop scheduling problem
, Article Computers and Industrial Engineering ; Volume 64, Issue 4 , April , 2013 , Pages 902-916 ; 03608352 (ISSN) ; Salmasi, N ; Sharif University of Technology
2013
Abstract
In this research, the no-wait flowshop sequence-dependent setup time scheduling problem with minimization of weighted earliness and tardiness penalties as the criterion, typically classified as Fm|nwt, S ijk|∑wj'Ej+wj ″Tj, is investigated. A mixed integer linear programming model for the research problem is proposed. As the problem is shown to be strongly NP-hard, several metaheuristic algorithms based on tabu search (TS) and particle swarm optimization (PSO) algorithms are developed to heuristically solve the problem. A timing algorithm is generated to find the optimal schedule and calculate the objective function value of a given sequence. In order to compare the performance of the...
A two-criteria objective function flexible flowshop scheduling problem with machine eligibility constraint
, Article International Journal of Advanced Manufacturing Technology ; Volume 64, Issue 5-8 , April , 2013 , Pages 1001-1015 ; 02683768 (ISSN) ; Salmasi, N ; Sharif University of Technology
2013
Abstract
This research deals with a flexible flowshop scheduling problem with the arrival and delivery of jobs in groups and processing them individually. Each group of jobs has a specific release time. Due to the special characteristics of each job, only a specific group of machines in each stage are eligible to process that job. All jobs in a group should be delivered at the same time after processing. The objectives of the problem are the minimization of the sum of the completion time of groups on one hand and the minimization of sum of the differences between the completion time of jobs and the delivery time of the group containing that job (waiting period) on the other hand. The problem can be...
Bicriteria scheduling of a two-machine flowshop with sequence-dependent setup times
, Article International Journal of Advanced Manufacturing Technology ; Volume 40, Issue 11-12 , 2009 , Pages 1216-1226 ; 02683768 (ISSN) ; Hendizadeh, S. H ; Salmasi, N ; Sharif University of Technology
2009
Abstract
A two-machine flowshop scheduling problem is addressed to minimize setups and makespan where each job is characterized by a pair of attributes that entail setups on each machine. The setup times are sequence-dependent on both machines. It is shown that these objectives conflict, so the Pareto optimization approach is considered. The scheduling problems considering either of these objectives are N p - hard, so exact optimization techniques are impractical for large-sized problems. We propose two multi-objective metaheurisctics based on genetic algorithms (MOGA) and simulated annealing (MOSA) to find approximations of Pareto-optimal sets. The performances of these approaches are compared with...
Generalized Tardiness Flow Shop Problem
, M.Sc. Thesis Sharif University of Technology ; Shavandi, Hassan (Supervisor)
Abstract
In this thesis, several metaheusristic algorithms for solving the generalized tardiness flow shop problem are proposed. In the generalized tardiness flowshop a due date is defined for every operation of the jobs. With the best of our knowledge is the first attempt to develop a genetic algorithm for the proposed problem. Several genetic algorithms are develpoed based on selecting the parents.The proposed GAs are tunned using experimtal analysis and the efficiency of lgorithms are analyzed with many randomly generated problems. Sensitivity analysis is also done to drive mangerial insights
Total completion time minimisation of no-wait flowshop group scheduling problem with sequence dependent setup times
, Article European Journal of Industrial Engineering ; Volume 11, Issue 1 , 2017 , Pages 22-48 ; 17515254 (ISSN) ; Salmasi, N ; Sharif University of Technology
Inderscience Enterprises Ltd
2017
Abstract
In this research, the no-wait flowshop sequence dependent group scheduling problem with minimisation of total completion time, noted as Fm|nwt, fmls, Splk|∑Cj is approached. A mixed integer linear mathematical model is proposed for the research problem. Due to the NP-hard nature of the proposed problem, several metaheuristic algorithms based on particle swarm optimisation and variable neighbourhood search with different neighbourhood search structures are proposed to heuristically solve the problem. Also, an efficient heuristic algorithm is proposed to generate the initial feasible solutions for the proposed algorithms. The performances of the proposed algorithms are compared with each other...