Solving Flow Shop Problems with Bounded Dynamic Programming

2012 ◽  
pp. 329-337
Author(s):  
Joaquín Bautista ◽  
Alberto Cano ◽  
Ramon Companys ◽  
Imma Ribas
Keyword(s):  
Dynamic Programming ◽  
Flow Shop

Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop

4OR ◽  
2020 ◽  
Author(s):  
Arianna Alfieri ◽  
Shuyu Zhou ◽  
Rosario Scatamacchia ◽  
Steef L. van de Velde
Keyword(s):  
Dynamic Programming ◽  
Lower Bounds ◽  
Flow Shop ◽  
Lot Streaming ◽  
Programming Algorithms

scholarly journals A Note on Multimachine Scheduling with Weighted Early/Late Work Criteria and Common Due Date

2021 ◽  
Vol 2021 ◽  
pp. 1-6
Author(s):  
Kerang Cao ◽  
Xin Chen ◽  
Kwang-nam Choi ◽  
Yage Liang ◽  
Qian Miao ◽  
...  
Keyword(s):  
Dynamic Programming ◽  
Flow Shop ◽  
Dynamic Programming Method ◽  
Programming Approach ◽  
Due Date ◽  
Enumeration Algorithm ◽  
Late Work ◽  
Common Due Date ◽  
Dynamic Programming Approach ◽  
Early Late

In this note, we revisit two types of scheduling problem with weighted early/late work criteria and a common due date. For parallel identical machines environment, we present a dynamic programming approach running in pseudopolynomial time, to classify the considered problem into the set of binary NP-hard. We also propose an enumeration algorithm for comparison. For two-machine flow shop systems, we focus on a previous dynamic programming method, but with a more precise analysis, to improve the practical performance during its execution. For each model, we verify our studies through computational experiments, in which we show the advantages of our techniques, respectively.

Sign in / Sign up

Export Citation Format

Share Document