Stochastic Flow-Shop Scheduling with Lateness-Related Performance Measures

1991 ◽  
Vol 5 (2) ◽  
pp. 245-254 ◽  
Author(s):  
Chung-Yee Lee ◽  
Chen-Sin Lin
Keyword(s):  
Performance Measures ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Stochastic Flow ◽  
Due Date ◽  
Scheduling Policies ◽  
Shop Scheduling ◽  
Processing Times

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.

Flow shop scheduling with flexible processing times

OR Spectrum ◽  
2018 ◽  
Vol 40 (3) ◽  
pp. 809-829 ◽  
Author(s):  
Matthias Bultmann ◽  
Sigrid Knust ◽  
Stefan Waldherr
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Shop Scheduling ◽  
Processing Times

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.

Sign in / Sign up

Export Citation Format

Share Document