Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date

2001 ◽  
Vol 132 (3) ◽  
pp. 643-665 ◽  
Author(s):  
K. Gowrishankar ◽  
Chandrasekharan Rajendran ◽  
G. Srinivasan
Keyword(s):  
Completion Time ◽  
Flow Shop ◽  
Scheduling Algorithms ◽  
Sum Of Squares ◽  
Flow Shop Scheduling ◽  
Due Date ◽  
Common Due Date ◽  
Shop Scheduling ◽  
Time Variance

Two-machine Flow Shop Scheduling with a Common Due Date to Maximize Total Early Work

2021 ◽  
Author(s):  
Xin Chen ◽  
Qian Miao ◽  
Bertrand M.T. Lin ◽  
Malgorzata Sterna ◽  
Jacek Blazewicz
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Due Date ◽  
Common Due Date ◽  
Shop Scheduling

Bi-objective hybrid flow shop scheduling with common due date

2019 ◽  
Author(s):  
Zhi Li ◽  
Ray Y. Zhong ◽  
Ali Vatankhah Barenji ◽  
J. J. Liu ◽  
C. X. Yu ◽  
...  
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Due Date ◽  
Common Due Date ◽  
Shop Scheduling ◽  
Hybrid Flow Shop Scheduling

Solving Flow Shop Scheduling Problems with Blocking by using Genetic Algorithm

2019 ◽  
Vol 9 (2) ◽  
pp. 20-38
Author(s):  
Harendra Kumar ◽  
Pankaj Kumar ◽  
Manisha Sharma
Keyword(s):  
Genetic Algorithm ◽  
Completion Time ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
Working Process ◽  
Shop Scheduling ◽  
Mutation Operators ◽  
And Inversion ◽  
Present Algorithm

Flow shop scheduling problems have been analyzed worldwide due to their various applications in industry. In this article, a new genetic algorithm (NGA) is developed to obtain the optimum schedule for the minimization of total completion time of n-jobs in an m-machine flow shop operating without buffers. The working process of the present algorithm is very efficient to implement and effective to find the best results. To implement the proposed algorithm more effectively, similar job order crossover operators and inversion mutation operators have been used. Numerous examples are illustrated to explain proposed approach. Finally, the computational results indicate that present NGA performs much superior to the heuristics for blocking flow shop developed in the literature.

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.

Sign in / Sign up

Export Citation Format

Share Document