Stochastic flow-shop scheduling with minimizing the expected number of tardy jobs

2012 ◽  
Vol 66 (1-4) ◽  
pp. 337-346 ◽  
Author(s):  
Ali Elyasi ◽  
Nasser Salmasi
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Stochastic Flow ◽  
Expected Number ◽  
Shop Scheduling ◽  
Number Of Tardy Jobs ◽  
Tardy Jobs

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.

Stochastic flow shop scheduling model for the Panama Canal

2011 ◽  
Vol 62 (1) ◽  
pp. 69-80 ◽  
Author(s):  
J Jackman ◽  
Z Guerra de Castillo ◽  
S Olafsson
Keyword(s):  
Flow Shop ◽  
Panama Canal ◽  
Flow Shop Scheduling ◽  
Stochastic Flow ◽  
Shop Scheduling ◽  
Scheduling Model
Sign in / Sign up

Export Citation Format

Share Document