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 CEJOR https://doi.org/10.1007/s10100-018-0553-8 ORIGINAL PAPER Mixed integer linear programming models for Flow Shop Scheduling with a demand plan of job types 1 2 Joaquín Bautista-Valhondo · Rocío Alfaro-Pozo © Springer-Verlag GmbH Germany, part of Springer Nature 2018 Abstract This paper presents two mixed integer linear programming (MILP) mod- els that extend two basic Flow Shop Scheduling problems: Fm/prmu/C and max Fm/block/C . This extension incorporates the concept of an overall demand plan max 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 Nis- san’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. Keywords Flow Shop Scheduling problem · Mixed model sequencing problem · Mixed model assembly lines · Overall demand plan · Mixed integer linear programming 1 Preliminaries The Flow Shop Scheduling problem (FSP) is a sequencing problem that has received considerable attention from professionals and researchers 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

Loading next page...
 
/lp/springer_journal/mixed-integer-linear-programming-models-for-flow-shop-scheduling-with-PCgkWcLH5E
Publisher
Springer Berlin Heidelberg
Copyright
Copyright © 2018 by Springer-Verlag GmbH Germany, part of Springer Nature
Subject
Business and Management; Operations Research/Decision Theory
ISSN
1435-246X
eISSN
1613-9178
D.O.I.
10.1007/s10100-018-0553-8
Publisher site
See Article on Publisher Site

Abstract

CEJOR https://doi.org/10.1007/s10100-018-0553-8 ORIGINAL PAPER Mixed integer linear programming models for Flow Shop Scheduling with a demand plan of job types 1 2 Joaquín Bautista-Valhondo · Rocío Alfaro-Pozo © Springer-Verlag GmbH Germany, part of Springer Nature 2018 Abstract This paper presents two mixed integer linear programming (MILP) mod- els that extend two basic Flow Shop Scheduling problems: Fm/prmu/C and max Fm/block/C . This extension incorporates the concept of an overall demand plan max 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 Nis- san’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. Keywords Flow Shop Scheduling problem · Mixed model sequencing problem · Mixed model assembly lines · Overall demand plan · Mixed integer linear programming 1 Preliminaries The Flow Shop Scheduling problem (FSP) is a sequencing problem that has received considerable attention from professionals and researchers

Journal

Central European Journal of Operations ResearchSpringer Journals

Published: May 29, 2018

References

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


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

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 lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off