A new proactive-reactive approach to hedge against uncertain processing times and unexpected machine failures in the two-machine flow shop scheduling problems

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.

Download Full-text

A Note on Flow Shop Scheduling with the Effects of Learning and Deterioration

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.513-517.2149 ◽

2014 ◽

Vol 513-517 ◽

pp. 2149-2152

Author(s):

Yu Ping Niu ◽

Ji Bo Wang

Keyword(s):

Learning Effect ◽

Flow Shop ◽

Flow Shop Scheduling ◽

Scheduling Problems ◽

Shop Scheduling ◽

Processing Times ◽

Polynomially Solvable ◽

Machine Scheduling Problems ◽

Completion Times ◽

Sum Of Completion Times

In this note, we consider the machine scheduling problems with the effects of learning and deterioration. In this model, job processing times are defined by functions dependent on their starting times and positions in the sequence. The scheduling objectives are makespan, sum of completion times. It is shown that even with the introduction of learning effect and deterioration jobs to job processing times, several flow shop problems remain polynomially solvable.

Download Full-text

An effective method for solving flow shop scheduling problems with fuzzy processing times

Computers & Industrial Engineering ◽

10.1016/0360-8352(93)90265-y ◽

1993 ◽

Vol 25 (1-4) ◽

pp. 239-242 ◽

Cited By ~ 25

Author(s):

Yasuhiro Tsujimura ◽

Seung Hun Park ◽

In Seong Chang ◽

Mitsuo Gen

Keyword(s):

Flow Shop ◽

Flow Shop Scheduling ◽

Scheduling Problems ◽

Shop Scheduling ◽

Processing Times ◽

Fuzzy Processing Times

Download Full-text

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

International Journal of Service Science Management Engineering and Technology ◽

10.4018/ijssmet.2021010105 ◽

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.

Download Full-text

Minimizing the Makespan for Scheduling Problems with General Deterioration Effects

Mathematical Problems in Engineering ◽

10.1155/2013/218981 ◽

2013 ◽

Vol 2013 ◽

pp. 1-8 ◽

Cited By ~ 1

Author(s):

Xianyu Yu ◽

Yulin Zhang ◽

Kai Huang

Keyword(s):

Processing Time ◽

Flow Shop ◽

Single Machine Scheduling ◽

Flow Shop Scheduling ◽

Scheduling Problems ◽

Shop Scheduling ◽

Processing Times ◽

Polynomially Solvable ◽

Machine Scheduling Problems ◽

Normal Processing

This paper investigates the scheduling problems with general deterioration models. By the deterioration models, the actual processing time functions of jobs depend not only on the scheduled position in the job sequence but also on the total weighted normal processing times of the jobs already processed. In this paper, the objective is to minimize the makespan. For the single-machine scheduling problems with general deterioration effects, we show that the considered problems are polynomially solvable. For the flow shop scheduling problems with general deterioration effects, we also show that the problems can be optimally solved in polynomial time under the proposed conditions.

Download Full-text