An adaptive branch and bound approach for transforming job shops into flow shops

Computers & Industrial Engineering ◽

10.1016/j.cie.2006.10.001 ◽

2007 ◽

Vol 52 (1) ◽

pp. 1-10 ◽

Author(s):

Jose M. Framinan

Keyword(s):

Branch And Bound ◽

Job Shops ◽

Download Full-text

Flow Shops, Job Shops and Open Shops (Stochastic)

10.1007/978-1-4614-2361-4_13 ◽

2011 ◽

pp. 349-372

Author(s):

Michael L. Pinedo

Keyword(s):

Job Shops ◽

Download Full-text

Flow Shops, Job Shops and Open Shops (Stochastic)

10.1007/978-0-387-78935-4_13 ◽

2008 ◽

pp. 345-368

Author(s):

Michael L. Pinedo

Keyword(s):

Job Shops ◽

Download Full-text

Flow Shops, Job Shops and Open Shops (Stochastic)

10.1007/978-3-319-26580-3_13 ◽

2016 ◽

pp. 349-372

Author(s):

Michael L. Pinedo

Keyword(s):

Job Shops ◽

Download Full-text

Inequalities for stochastic flow shops and job shops

Applied Stochastic Models and Data Analysis ◽

10.1002/asm.3150020106 ◽

1986 ◽

Vol 2 (1-2) ◽

pp. 61-69 ◽

Author(s):

Michael Pinedo ◽

Sung-Hwan Wie

Keyword(s):

Stochastic Flow ◽

Job Shops ◽

Download Full-text

Efficient heuristic approaches to transform job shops into flow shops

IIE Transactions ◽

10.1080/07408170590918191 ◽

2005 ◽

Vol 37 (5) ◽

pp. 441-451 ◽

Author(s):

JOSE M. FRAMINAN

Keyword(s):

Job Shops ◽

Heuristic Approaches

Download Full-text

A Simulation-Based Performance Comparison Between Flow Shops and Job Shops

Learning in the Digital Era - IFIP Advances in Information and Communication Technology ◽

10.1007/978-3-030-92934-3_33 ◽

2021 ◽

pp. 326-332

Author(s):

Christoph Roser ◽

Daniel Ballach ◽

Bernd Langer ◽

Claas-Christian Wuttke

Keyword(s):

Performance Comparison ◽

Job Shops ◽

Simulation Based

Download Full-text

A branch-and-bound algorithm for makespan minimization in differentiation flow shops

Engineering Optimization ◽

10.1080/0305215x.2012.737783 ◽

2013 ◽

Vol 45 (12) ◽

pp. 1397-1408 ◽

Author(s):

Yen-Cheng Liu ◽

Kuei-Tang Fang ◽

Bertrand Lin

Keyword(s):

Branch And Bound ◽

Branch And Bound Algorithm ◽

Makespan Minimization ◽

Download Full-text

A branch-and-bound algorithm for permutation flow shops with sequence-dependent setup times

IIE Transactions ◽

10.1080/07408179908969871 ◽

1999 ◽

Vol 31 (8) ◽

pp. 721-731 ◽

Author(s):

ROGER Z. RIOS-MERCADO ◽

JONATHAN F. BARD

Keyword(s):

Branch And Bound ◽

Setup Times ◽

Branch And Bound Algorithm ◽

Sequence Dependent ◽

Sequence Dependent Setup ◽

Dependent Setup Times ◽

Sequence Dependent Setup Times

Download Full-text

On transforming job-shops into flow-shops

Production Planning & Control ◽

10.1080/09537280110069748 ◽

2002 ◽

Vol 13 (2) ◽

pp. 166-174 ◽

Author(s):

Jose M. Framinan ◽

Rafael Ruiz-Usano

Keyword(s):

Job Shops ◽

Download Full-text

A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops

IIE Transactions ◽

10.1080/07408179808966443 ◽

1998 ◽

Vol 30 (2) ◽

pp. 109-118 ◽

Author(s):

MARCOS SINGER ◽

MICHAEL PINEDO

Keyword(s):

Branch And Bound ◽

Computational Study ◽

Total Weighted Tardiness ◽

Job Shops ◽

Weighted Tardiness ◽

Branch And Bound Techniques

Download Full-text