scholarly journals Solving Constrained Flow-Shop Scheduling Problem through Multistage Fuzzy Binding Approach with Fuzzy Due Dates

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Hamiden Abd El-Wahed Khalifa ◽  
Sultan S. Alodhaibi ◽  
Pavan Kumar
Keyword(s):  
Fuzzy Numbers ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Due Dates ◽  
Optimal Sequence ◽  
Elapsed Time ◽  
Processing Times ◽  
Scheduling Model ◽  
Interval Approximation ◽  
Real World Problems

This paper deals with constrained multistage machines flow-shop (FS) scheduling model in which processing times, job weights, and break-down machine time are characterized by fuzzy numbers that are piecewise as well as quadratic in nature. Avoiding to convert the model into its crisp, the closed interval approximation for the piecewise quadratic fuzzy numbers is incorporated. The suggested method leads a noncrossing optimal sequence to the considered problem and minimizes the total elapsed time under fuzziness. The proposed approach helps the decision maker to search for applicable solution related to real-world problems and minimizes the total fuzzy elapsed time. A numerical example is provided for the illustration of the suggested methodology.

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 Minimization of Rental Cost for Specially Structured Scheduling Model with Setup Time and Transportation Time

2020 ◽  
Vol 9 (3) ◽  
pp. 2866-2869
Keyword(s):  
Flow Shop ◽  
Setup Time ◽  
Flow Shop Scheduling ◽  
Processing Unit ◽  
Optimal Sequence ◽  
Processing Times ◽  
Scheduling Model ◽  
Heuristic Technique ◽  
Important Means ◽  
State Of Affairs

In the paper under consideration we have developed a new heuristic technique, to get the optimal sequence in which the jobs are to be processed so as to minimize the utilization time for which the machines are required and hence optimize the total expenditure incurred in hiring the machines on rent in case of a two stage specially structured flow shop scheduling model under pre-defined rental policy in which the processing times and setup times are linked with their relative probabilities, together with time taken for transporting the jobs from one processing unit to the next unit. The study taken up is quite broader and relates to the state of affairs existing in industrial units. The method given in this paper is reasonably simple and easy to apply and also offer an important means for taking decision regarding achieving an optimal sequence of jobs. Algorithm given in this paper is also explained by means of a numerical example.

Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates

2020 ◽  
Vol 37 (01) ◽  
pp. 1950032
Author(s):  
Myoung-Ju Park ◽  
Byung-Cheon Choi ◽  
Yunhong Min ◽  
Kyung Min Kim
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Due Dates ◽  
Shop Scheduling ◽  
Processing Times ◽  
Specific Position ◽  
Polynomially Solvable ◽  
Definition Of ◽  
Tardy Jobs ◽  
Np Hardness

We consider a two-machine flow shop scheduling with two properties. The first is that each due date is assigned for a specific position different from the traditional definition of due dates, and the second is that a consistent pattern exists in the processing times within each job and each machine. The objective is to minimize maximum tardiness, total tardiness, or total number of tardy jobs. We prove the strong NP-hardness and inapproximability, and investigate some polynomially solvable cases. Finally, we develop heuristics and verify their performances through numerical experiments.

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.

USING GENETIC ALGORITHMS TO SOLVE FUZZY FLOW SHOP SCHEDULING PROBLEMS BASED ON POSSIBILITY AND NECESSITY MEASURES

2008 ◽  
Vol 16 (03) ◽  
pp. 409-433 ◽  
Author(s):  
PENG-JEN LAI ◽  
HSIEN-CHUNG WU
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Fuzzy Sets Theory ◽  
Scheduling Problems ◽  
Due Dates ◽  
Objective Functions ◽  
Earliness And Tardiness ◽  
Processing Times ◽  
Fuzzy Processing Times ◽  
Sets Theory

The scheduling problems with fuzzy processing times and fuzzy due dates are investigated in this paper. The concepts of earliness and tardiness are interpreted by using the concepts of possibility and necessity measures that were developed in fuzzy sets theory. Many types of objective function will be taken into account through the different combinations of possibility and necessity measures. The purpose of this paper is to obtain the optimal schedules based on these objective functions. The genetic algorithm will be invoked to tackle these objective functions. Four numerical examples are also provided and solved by using the commercial software MATLAB.

Investigating the Efficiency of GRASP for the SDST HFS with Controllable Processing Times and Assignable Due Dates

2014 ◽  
pp. 538-567
Author(s):  
Maryam Ashrafi ◽  
Hamid Davoudpour ◽  
Mohammad Abbassi
Keyword(s):  
Flow Shop ◽  
A Priori ◽  
Optimization Criterion ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Controllable Processing Times ◽  
Due Dates ◽  
Processing Times ◽  
Hybrid Flow Shop Scheduling ◽  
Dependent Setup Times

This chapter deals with a hybrid flow shop scheduling problem involving sequence dependent setup times, commonly known as the SDST hybrid flow shop, and each stage (work centre) consists of parallel identical machines. In this problem, each job has a different release date and consists of ordered operations that must be processed on machines from different centers in the same order. In addition, the processing times of operations on some machine centers may vary between a minimum and a maximum value depending on the use of a continuously divisible resource. We consider a non-regular optimization criterion based on due dates which are not a priori given or fixed but can be assigned by a decision-maker. A due date assignment cost is also included into the objective function. Finally, the results obtained through the use of GRASP (Greedy Randomized Adaptive Search Procedure) are compared with those computed by SA (Simulated Annealing).

Heuristic for Three Machines Flow Shop Scheduling Problem to Minimize the Weighted Mean Flow Time

2012 ◽  
Vol 548 ◽  
pp. 714-718
Author(s):  
Ibrahima Camara ◽  
Hong Zhou
Keyword(s):  
Flow Shop ◽  
Flow Time ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Mean Flow ◽  
Production Flow ◽  
Weighted Mean ◽  
Optimal Sequence ◽  
Shop Scheduling ◽  
Processing Times

In practical situations, machines might not be available during certain time of period due to deterministic or stochastic causes in many production systems. And, processing times are always not exact as they have been predicted. In this paper, we attempted to study the three machines flow shop scheduling problem in which probabilities are associated with processing times of jobs involving transportation time, machine breakdown interval and weights of jobs. A simple heuristic approach is proposed to find optimal or near optimal sequence minimizing the weighted mean production flow time. A numerical example has been provided to illustrate and clarify the proposed algorithm.

Sign in / Sign up

Export Citation Format

Share Document