Flow-shop scheduling problem with imprecise processing times based on distance ranking of fuzzy numbers

2016 ◽  
Author(s):  
Feng-Tse Lin ◽  
Chieh-Hung Huang
Keyword(s):  
Fuzzy Numbers ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
Processing Times ◽  
Ranking Of Fuzzy Numbers

USING ANT COLONY OPTIMIZATION TO MINIMIZE THE FUZZY MAKESPAN AND TOTAL WEIGHTED FUZZY COMPLETION TIME IN FLOW SHOP SCHEDULING PROBLEMS

2009 ◽  
Vol 17 (04) ◽  
pp. 559-584 ◽  
Author(s):  
PENG-JEN LAI ◽  
HSIEN-CHUNG WU
Keyword(s):  
Completion Time ◽  
Ant Colony Algorithm ◽  
Fuzzy Numbers ◽  
Flow Shop ◽  
Computational Procedure ◽  
Ant Colony ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
Shop Scheduling ◽  
Processing Times

The flow shop scheduling problems with fuzzy processing times are investigated in this paper. For some special kinds of fuzzy numbers, the analytic formulas of the fuzzy compltion time can be obtained. For the general bell-shaped fuzzy numbers, we present a computational procedure to obtain the approximated membership function of the fuzzy completion time. We define a defuzzification function to rank the fuzzy numbers. Under this ranking concept among fuzzy numbers, we plan to minimize the fuzzy makespan and total weighted fuzzy completion time. Because the ant colony algorithm has been successfully used to solve the scheduling problems with real-valued processing times, we shall also apply the ant colony algorithm to search for the best schedules when the processing times are assumed as fuzzy numbers. Numerical examples are also provided and solved by using the commercial software MATLAB.

scholarly journals Minimization of Utilization Time for Specially Structured n × 3 Scheduling Model with Jobs in a String of Disjoint Job Blocks

2019 ◽  
Vol 8 (12) ◽  
pp. 3554-3558
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Numerical Illustration ◽  
Optimal Sequence ◽  
Shop Scheduling ◽  
Elapsed Time ◽  
Processing Times ◽  
Scheduling Model ◽  
Utilization Time

The present paper investigates n×3 specially structured flow shop scheduling model with processing of jobs on given machines in a string of disjoint job blocks and with probabilities associated to the processing times of jobs. The objective is to minimize utilization time of second and third machine and also minimize the total elapsed time for processing the jobs for n×3 specially structured flow shop scheduling problem. The algorithm developed in this paper is quite straightforward and easy to understand and also present an essential way out to the decision maker for attaining an optimal sequence of jobs. The algorithm developed in this paper is validated by a numerical illustration.

scholarly journals An ant colony system for solving fuzzy flow shop scheduling problem

2012 ◽  
Vol 1 (2) ◽  
pp. 44 ◽  
Author(s):  
Nasser Shahsavari Pour ◽  
Mohammad hossein Abolhasani Ashkezari ◽  
Hamed Mohammadi Andargoli
Keyword(s):  
Fuzzy Numbers ◽  
Flow Shop ◽  
Ant Colony ◽  
Flow Shop Scheduling ◽  
Process Time ◽  
Ant Colony System ◽  
Scheduling Problem ◽  
Computational Results ◽  
Shop Scheduling ◽  
The Past

During the past years, the flow shop has been regarded by many researchers and some extensive investigations have been done on this respect. Flow Shop includes n works performed on m machines in a same sequence. It is very difficult in the real world to determine the exact process time of an operation on a machine. Therefore, we consider in this article the process time as trapezoidal fuzzy numbers. Our purpose is that we obtain a sequence of works using such fuzzy numbers in order to minimize maximum fuzzy time of completion entire jobs or fuzzy makespan. We offered an optimization algorithm of Ant Colony System (ACS) to solve this problem. Finally, we present computational results for explanation and comparison with other articles in future.

A MILP and Genetic Algorithm Approach for a Furniture Manufacturing Flow Shop Scheduling Problem

2019 ◽  
pp. 238-259
Author(s):  
Marcell S. Kalman ◽  
Omar G. Rojas ◽  
Elias Olivares-Benitez ◽  
Samuel Moisés Nucamendi-Guillén
Keyword(s):  
Genetic Algorithm ◽  
Flow Shop ◽  
Solution Time ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Algorithm Optimization ◽  
Shop Scheduling ◽  
Processing Times ◽  
Furniture Manufacturing ◽  
Genetic Algorithm Approach

A MILP and genetic algorithm optimization model for the sequencing of jobs in a medium-sized factory, dedicated to the manufacturing of home furniture, where different categories and types of articles are produced and whose routes and manufacturing processing times vary widely, are proposed. Different scenarios are considered for the objective function based on minimizing makespan and tardiness. The results of the optimization for an instance of 24 jobs on five machines, chosen as a representative instance of the order sizes that are handled by the company, show important reductions in the productive system's usage times, oscillating between 10% and 20% with respect to a random initial sequence in the production plan. Improvements were similar in both techniques, the main difference being the solution time of each one.

Sign in / Sign up

Export Citation Format

Share Document