Research on multiobjective flow shop scheduling with stochastic processing times and machine breakdowns

2008 ◽  
Author(s):  
Qiang Zhou ◽  
Xunxue Cui
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Machine Breakdowns ◽  
Shop Scheduling ◽  
Processing Times ◽  
Stochastic Processing ◽  
Stochastic Processing Times

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.

Sign in / Sign up

Export Citation Format

Share Document