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

Author(s):  
Xin Chen ◽  
Qian Miao ◽  
Bertrand M.T. Lin ◽  
Malgorzata Sterna ◽  
Jacek Blazewicz
Author(s):  
Zhi Li ◽  
Ray Y. Zhong ◽  
Ali Vatankhah Barenji ◽  
J. J. Liu ◽  
C. X. Yu ◽  
...  

2011 ◽  
Vol 189-193 ◽  
pp. 2746-2753 ◽  
Author(s):  
Hai Bo Tang ◽  
Chun Ming Ye ◽  
Liang Fu Jiang

Coping with the characteristic of flow shop scheduling problem with uncertain due date, fuzzy arithmetic on fuzzy numbers is applied to describe the problem, and then a new hybrid algorithm model which integrate particle swarm optimization into the evolutionary mechanism of the knowledge evolution algorithm is presented to solve the problem. By the evolutionary mechanism of knowledge evolution algorithm, we can exploit the global search ability. By the operating characteristic of PSO, we can enhance the local search ability. The algorithm is tested with MATLAB simulation. The result, compared with Genetic algorithm and modified particle swarm optimization, shows the feasibility and effectiveness of the proposed algorithm.


Author(s):  
M. Duran Toksari

This research is to develop an approximate solution for a flow shop scheduling problem under the effects of fuzzy learning and deterioration with a common fuzzy due date by applying genetic algorithm technique. Real life is complex and filled with ambiguity and uncertainty. Due dates may not be always determined by a decision maker because of their biased approach and past experiences. Therefore, due dates may be defined in forms of any fuzzy set to encode decision maker’s biased approaches and satisfaction levels for completion times of jobs. The objective function of the problem in this research is to maximise decision maker’s sum of satisfaction levels with respect to completion times of jobs on a flow shop scheduling environment by applying genetic algorithm technique. Keywords: Flow shop, fuzzy due date, genetic algorithm, learning effect, deterioration effect.


1991 ◽  
Vol 5 (2) ◽  
pp. 245-254 ◽  
Author(s):  
Chung-Yee Lee ◽  
Chen-Sin Lin

In this paper we consider stochastic flow-shop scheduling with reference to certain lateness-related performance measures. We show that for various assumptions on the distribution of job-processing times of a flow shop, certain scheduling policies following the stochastic analogy of the Earliest Due Date (EDD) rule yield optimal results.


Sign in / Sign up

Export Citation Format

Share Document