Mixed integer linear programming models for Flow Shop Scheduling with a demand plan of job types

Mixed integer linear programming models for Flow Shop Scheduling with a demand plan of job types This paper presents two mixed integer linear programming (MILP) models that extend two basic Flow Shop Scheduling problems: Fm\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$ {\text{Fm}} $$\end{document}/prmu\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$ {\text{prmu}} $$\end{document}/Cmax\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$ {\text{C}}_{ \hbox{max} } $$\end{document} and Fm\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$ {\text{Fm}} $$\end{document}/block\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$ {\text{block}} $$\end{document}/Cmax\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$ {\text{C}}_{ \hbox{max} } $$\end{document}. This extension incorporates the concept of an overall demand plan for types of jobs or products. After using an example to illustrate the new problems under study, we evaluated the new models and analyzed their behaviors when applied to instances found in the literature and industrial instances of a case study from Nissan’s plant in Barcelona. CPLEX solver was used as a solution tool and obtained acceptable results, allowing us to conclude that MILP can be used as a method for solving Flow Shop Scheduling problems with an overall demand plan. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Central European Journal of Operations Research Springer Journals

Mixed integer linear programming models for Flow Shop Scheduling with a demand plan of job types

19 pages
Read Article

Loading next page...
 
/lp/springer_journal/mixed-integer-linear-programming-models-for-flow-shop-scheduling-with-PCgkWcLH5E
Publisher
Springer Journals
Copyright
Copyright © Springer-Verlag GmbH Germany, part of Springer Nature 2018
ISSN
1435-246X
eISSN
1613-9178
DOI
10.1007/s10100-018-0553-8
Publisher site
See Article on Publisher Site

Abstract

This paper presents two mixed integer linear programming (MILP) models that extend two basic Flow Shop Scheduling problems: Fm\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$ {\text{Fm}} $$\end{document}/prmu\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$ {\text{prmu}} $$\end{document}/Cmax\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$ {\text{C}}_{ \hbox{max} } $$\end{document} and Fm\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$ {\text{Fm}} $$\end{document}/block\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$ {\text{block}} $$\end{document}/Cmax\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$ {\text{C}}_{ \hbox{max} } $$\end{document}. This extension incorporates the concept of an overall demand plan for types of jobs or products. After using an example to illustrate the new problems under study, we evaluated the new models and analyzed their behaviors when applied to instances found in the literature and industrial instances of a case study from Nissan’s plant in Barcelona. CPLEX solver was used as a solution tool and obtained acceptable results, allowing us to conclude that MILP can be used as a method for solving Flow Shop Scheduling problems with an overall demand plan.

Journal

Central European Journal of Operations Research – Springer Journals

Published: Mar 29, 2020

References

  • Minimizing the makespan for the flow shop scheduling problem with availability constraints
    Aggoune, R
  • Solving mixed model sequencing problem in assembly lines with serial workstations with work overload minimisation and interruption rules
    Bautista, J; Cano, A
  • An expert system to minimize operational costs in mixed-model sequencing problems with activity factor
    Bautista-Valhondo, J; Alfaro-Pozo, R
  • Solving the Fm|block|Cmax problem using Bounded Dynamic Programming
    Bautista, J; Cano, A; Companys, R; Ribas, I
  • Closing the gap between practice and research in industrial engineering. Lecture notes in management and industrial engineering
    Bautista, J; Alfaro-Pozo, R; Batalla-García, C
  • Minimizing makespan in a blocking flowshop using genetic algorithms
    Caraffa, V; Ianes, S; Bagchi, TP; Sriskandarajah, C
  • A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
    Fernandez-Viagas, V; Ruiz, R; Framinan, JM
  • The permutation flow shop problem with blocking. A tabu search approach
    Grabowski, J; Pempera, J
  • Optimization and approximation in deterministic sequencing and scheduling: a survey
    Graham, RL; Lawler, EL; Lenstra, JK; Rinnooy Kan, AHG
  • Survey of machine scheduling problems with blocking and no-wait in process
    Hall, NG; Sriskandarajah, C
  • An improved artificial bee colony algorithm for the blocking flowshop scheduling problema
    Han, YY; Pan, QK; Li, JQ
  • Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
    Hoogeveen, JA; Lenstra, JK; Veltman, B
  • Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithm
    Lin, SW; Ying, KC
  • Two-machine group scheduling problem with blocking and anticipatory setups
    Logendran, R; Sriskandarajah, C
  • A heuristic algorithm for the m-machine, n-job flow-shop sequencing problema
    Nawaz, M; Enscore, EE; Ham, I
  • Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking
    Nouri, N; Ladhari, T
  • Simulated annealing for permutation flow-shop scheduling
    Osman, IH; Potts, CN
  • Improved bounded dynamic programming algorithm for solving the blocking flow shop problem
    Ozolins, A
  • Effective heuristics for the blocking flowshop scheduling problem with makespan minimization
    Pan, QK; Wang, L
  • Scheduling (theory, algorithms, and systems)
    Pinedo, ML
  • A genetic algorithm for flowshop sequencing
    Reeves, CR
  • An iterated greedy algorithm for the flowshop scheduling problem with blocking
    Ribas, I; Companys, R; Tort-Martorell, X
  • A note on constructive heuristics for the flowshop problem with blocking
    Ronconi, DP
  • A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
    Ronconi, DP
  • Some efficient heuristic methods for the flow shop sequencing problema
    Taillard, E
  • Benchmarks for basic scheduling problems
    Taillard, E
  • Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
    Tasgetiren, MF; Kizilay, D; Pan, QK; Suganthanc, PN
  • An ant colony system for permutation flow-shop sequencing
    Ying, KC; Liao, CJ
  • Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
    Yu, W; Hoogeveen, H; Lenstra, JK

You’re reading a free preview. Subscribe to read the entire article.

Try 2 weeks free now

DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

or browse the journals available

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create folders to
organize your research

Export folders, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off

Sign up
for free
Start 14 day
Free Trial