A new approach for solving flow shop scheduling problems with generalized intuitionistic fuzzy numbers

2019 ◽  
Vol 37 (3) ◽  
pp. 4287-4297 ◽  
Author(s):  
T. Yogashanthi ◽  
S. Mohanaselvi ◽  
K. Ganesan
Keyword(s):  
Fuzzy Numbers ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
New Approach ◽  
Intuitionistic Fuzzy Numbers ◽  
Shop Scheduling ◽  
Intuitionistic Fuzzy

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.

A New Approach for Solving the Flow Shop Scheduling Problem Through Neural Network Technique With Known Breakdown Time and Weights of Jobs

2021 ◽  
Vol 12 (1) ◽  
pp. 77-96
Author(s):  
Harendra Kumar ◽  
Shailendra Giri
Keyword(s):  
Neural Network ◽  
Flow Shop ◽  
Flow Time ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
New Approach ◽  
Shop Scheduling ◽  
Processing Times ◽  
Breakdown Time ◽  
Major Constraint

This paper considers a flow shop scheduling problems of n jobs on m machines involving processing times and weights of jobs with the major constraint as breakdown times of the machines. In this paper a new procedure is provided to obtain an optimal job sequence with the objective of minimize the makespan and mean weighted flow time by using neural network technique. To illustrate the proposed method procedure, a numerical example is given. The effectiveness of the proposed method is compared with many problems which are taken from different papers. This paper also provides a comparison of our proposed method with the existing methods in literature.

Two-machine flow shop scheduling problems with minimal and maximal delays

4OR ◽  
2006 ◽  
Vol 4 (1) ◽  
pp. 15-28 ◽  
Author(s):  
Jean-Louis Bouquard ◽  
Christophe Lenté
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
Shop Scheduling
Sign in / Sign up

Export Citation Format

Share Document