Scheduling in the Aeronautical Industry Using a Mixed Integer Linear Problem Formulation

Scheduling is becoming much more important in every industry. At the same time, scheduling problems have been the subject of continuous research since the early days of operations research. However, the standard resource constraint scheduling problem (RCSP) usually does not cover all the characteris...

Full description

Saved in:
Bibliographic Details
Published inProcedia engineering Vol. 132; pp. 982 - 989
Main Authors Borreguero, T., García, A., Ortega, M.
Format Journal Article
LanguageEnglish
Published Elsevier Ltd 2015
Subjects
Online AccessGet full text
ISSN1877-7058
1877-7058
DOI10.1016/j.proeng.2015.12.586

Cover

Abstract Scheduling is becoming much more important in every industry. At the same time, scheduling problems have been the subject of continuous research since the early days of operations research. However, the standard resource constraint scheduling problem (RCSP) usually does not cover all the characteristics of real world problems. In this work, we present an Event Based Mixed Integer Linear Problem (MILP) formulation for a Multimode Resource Constraint Problem (MRCSP) of direct application for some industries, as aerospace final assembly lines. Taking as a starting point one of the last MILP formulations for standard RCSP, its contribution is to provide a formulation which covers the multimode case and more general temporal constraints than the ones usually referred to in the literature. This publication focuses on the computational results, their relevance and their impact for a future extension to solving real world instances.
AbstractList Scheduling is becoming much more important in every industry. At the same time, scheduling problems have been the subject of continuous research since the early days of operations research. However, the standard resource constraint scheduling problem (RCSP) usually does not cover all the characteristics of real world problems. In this work, we present an Event Based Mixed Integer Linear Problem (MILP) formulation for a Multimode Resource Constraint Problem (MRCSP) of direct application for some industries, as aerospace final assembly lines. Taking as a starting point one of the last MILP formulations for standard RCSP, its contribution is to provide a formulation which covers the multimode case and more general temporal constraints than the ones usually referred to in the literature. This publication focuses on the computational results, their relevance and their impact for a future extension to solving real world instances.
Author Ortega, M.
Borreguero, T.
García, A.
Author_xml – sequence: 1
  givenname: T.
  surname: Borreguero
  fullname: Borreguero, T.
  email: tamara.borreguero@airbus.com
  organization: AIRBUS Group, Av. García Morato s/n, 41011 Seville, Spain
– sequence: 2
  givenname: A.
  surname: García
  fullname: García, A.
  organization: IOL Research Group. ETSII. UPM Madrid. José Gutiérrez Abascal,2, 28006 Madrid, Spain
– sequence: 3
  givenname: M.
  surname: Ortega
  fullname: Ortega, M.
  organization: IOL Research Group. ETSII. UPM Madrid. José Gutiérrez Abascal,2, 28006 Madrid, Spain
BookMark eNqNkFFLwzAQx4MoOOe-gQ_5AqtJmq6tD8IYTgcTBR34FtLkumVk6UhTdd_e1vogPqj3csdxvz_c7wwdu8oBQheURJTQyeU22vsK3DpihCYRZVGSTY7QgGZpOk5Jkh1_m0_RqK63pKuUsIQO0MuT2oBurHFrbBwOG8BT8JWTTTBKWrxwuqmDP-BV3Z1IfG_eQbfrAGvweGkcSI8ffVVY2OF55XeNlcFU7hydlNLWMPrqQ7Sa3zzP7sbLh9vFbLocqzhhYczLnHMALrM0j0FNSAayYEynsaaFVCwGAJmXJeE5y4pUU15qxbkiLE6ULuJ4iJI-t3F7eXiT1oq9NzvpD4IS0RkSW9EbEp0hQZloDbUc7znlq7r2UP4Xu_qBKRM-Hw5eGvsXfN3D0Ap5NeBFrQw4Bdp4UEHoyvwe8AHG7ZnR
CitedBy_id crossref_primary_10_1109_ACCESS_2017_2761994
crossref_primary_10_1080_00207543_2020_1771456
crossref_primary_10_1016_j_cor_2024_106888
crossref_primary_10_1016_j_apm_2019_11_047
crossref_primary_10_1007_s10479_023_05629_3
Cites_doi 10.1287/opre.32.1.89
10.1287/mnsc.16.1.93
10.1007/s10951-008-0059-7
10.1016/j.ejor.2009.11.005
10.1016/0377-2217(93)90062-R
10.1016/j.cor.2010.05.006
10.1007/s12209-010-1495-y
10.1016/S0377-2217(02)00758-0
10.1007/978-3-319-04705-8_13
10.1007/978-3-642-23929-8
10.1016/S0377-2217(98)00204-5
10.1109/ICMSAO.2013.6552557
10.1016/j.cor.2009.12.011
ContentType Journal Article
Copyright 2015 The Authors
Copyright_xml – notice: 2015 The Authors
DBID 6I.
AAFTH
AAYXX
CITATION
ADTOC
UNPAY
DOI 10.1016/j.proeng.2015.12.586
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CrossRef
Unpaywall for CDI: Periodical Content
Unpaywall
DatabaseTitle CrossRef
DatabaseTitleList
Database_xml – sequence: 1
  dbid: UNPAY
  name: Unpaywall
  url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/
  sourceTypes: Open Access Repository
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1877-7058
EndPage 989
ExternalDocumentID 10.1016/j.proeng.2015.12.586
10_1016_j_proeng_2015_12_586
S1877705815044987
GroupedDBID --K
0R~
0SF
1B1
4.4
457
5VS
6I.
71M
AACTN
AAEDT
AAEDW
AAFTH
AAFWJ
AAIKJ
AALRI
AAQFI
AAXUO
ABMAC
ACGFS
ADBBV
ADEZE
ADMUD
AEXQZ
AFTJW
AGHFR
AITUG
ALMA_UNASSIGNED_HOLDINGS
AMRAJ
E3Z
EBS
EJD
EP3
FDB
FEDTE
FNPLU
HVGLF
HZ~
IXB
KQ8
M41
M~E
NCXOZ
O-L
O9-
OK1
OZT
P2P
RIG
ROL
SES
SSZ
XH2
AAYWO
AAYXX
ABWVN
ACRPL
ACVFH
ADCNI
ADNMO
ADVLN
AEUPX
AFPUW
AIGII
AKBMS
AKRWK
AKYEP
CITATION
~HD
ADTOC
UNPAY
ID FETCH-LOGICAL-c352t-4f944ee4a8793ec608eab22d73d1bac23eeea9ff04928b7d14fdc44c0235cdb33
IEDL.DBID UNPAY
ISSN 1877-7058
IngestDate Tue Aug 19 22:22:01 EDT 2025
Wed Oct 01 04:18:58 EDT 2025
Thu Apr 24 22:51:58 EDT 2025
Fri Feb 23 02:33:52 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Keywords Scheduling
MILP Model
Aerospace
Exact method
Language English
License http://creativecommons.org/licenses/by-nc-nd/4.0
cc-by-nc-nd
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c352t-4f944ee4a8793ec608eab22d73d1bac23eeea9ff04928b7d14fdc44c0235cdb33
OpenAccessLink https://proxy.k.utb.cz/login?url=https://doi.org/10.1016/j.proeng.2015.12.586
PageCount 8
ParticipantIDs unpaywall_primary_10_1016_j_proeng_2015_12_586
crossref_primary_10_1016_j_proeng_2015_12_586
crossref_citationtrail_10_1016_j_proeng_2015_12_586
elsevier_sciencedirect_doi_10_1016_j_proeng_2015_12_586
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2015
2015-00-00
PublicationDateYYYYMMDD 2015-01-01
PublicationDate_xml – year: 2015
  text: 2015
PublicationDecade 2010
PublicationTitle Procedia engineering
PublicationYear 2015
Publisher Elsevier Ltd
Publisher_xml – name: Elsevier Ltd
References J. Hurink, A. Kok, J. Paulus, J. Schutten, Time-constrained project scheduling with adjacent resources, Computers & Operations Research 38 (1) (2011) pp. 310-319.
R.L. Ackoff, C.W. Churchman and E.L. Arnoff. Introduction to Operational Research. John Wiley (1957).
O. Koné. Nouvelles approches pour la résolution du problème d’ordonnancement de projet a moyens limites. PhD thèsis, Université Toulouse III - Paul Sabatier (2009).
V. E. Gastelum. Application of lean manufacturing techniques for the design of the aircraft assembly line, Master's thesis. Massachusets Institute of Technology (2002).
A. Alan B. Pritsker, L.J. Watters, and P. M. Wolfe. Multiproject scheduling with limited resources: A zero-one programming approach. Management Science, 16(1)(1969), pp. 93-108.
GV. Reklaitis, JC. Zapata and BM. Hodge. The multimode resource constrained multiproject. scheduling problem: alternative formulations. AIChEJournal, 54(8) (2008) pp. 01-19.
J.M. Tamarit, R. Alvarez-Valdés. The project scheduling polyhedron: Dimension, facets and lifting theorems. European Journal of Operational Research, 67 (1993), pp. 204-220.
H. Wang, T. Li, D. Lin, Efficient genetic algorithm for resource constrained project scheduling problem, Transactions of Tianjin University 16 (5) (2010) pp. 376-382.
P. Brucker and S. Knust. Complex Scheduling. GOR-Publications. Springer (2011).
P. Brucker, A. Drexl, R. Möhring, K. Neumann, and E. Pesch. Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research, 112(1) (1999), pp. 3-41.
S. Hartmann, D. Briskorn, A survey of variants and extensions of the resource-constrained project scheduling problem, European Journal of Operational Research 207 (1) (2010) pp. 1-14.
C. Artigues, P. Michelon, and S. Reusser. Insertion techniques for static and dynamic resource-constrained project scheduling. European Journal of Operational Research, 149(2) (2003), pp. 249-267.
O. Koné, C. Artigues, P. Lopez, M. Mongeau, Event-based MILP models for resource-constrained project scheduling problems, Computers & Operations Research 38 (1) (2011), pp. 3-13.
PSPLIB library : http://www.om-db.wi.tum.de/psplib/main.html.
C. Artigues, S. Demassey, Resource-Constrained Project Scheduling: Models, Algorithms, Extensions and Applications, Wiley Library (2010).
J.A. Lawrence and B. Pasternack. Applied Management Science, John Wiley (2002).
R. H. Mohring, Minimizing costs of resource requirements in project networks subject to a fixed completion time. Operations Research 32 (1) (1984) pp. 89-120.
T.A. Guldemond, J.L. Hurink, Time-constrained project scheduling, J. Scheduling 11 (2008) pp. 137-148.
N. Nouri, S. Krichen, T. Ladhari, P. Fatimah, A discrete artificial bee colony algorithm for resource-constrained project scheduling problem. 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO) (2013) pp. 1-6.
T. Borreguero, Á. García, M. Ortega, A MILP Event Based Formulation for a Real-World Multimode RCSP with Generalized Temporal Constraints. Managing Complexity, Springer. (2014) pp 113-120.
APSP : https://www.dropbox.com/sh/9070da1dz6typ2o/V0jCAtR_8y.
10.1016/j.proeng.2015.12.586_bib0020
10.1016/j.proeng.2015.12.586_bib0075
10.1016/j.proeng.2015.12.586_bib0030
10.1016/j.proeng.2015.12.586_bib0085
10.1016/j.proeng.2015.12.586_bib0040
10.1016/j.proeng.2015.12.586_bib0095
10.1016/j.proeng.2015.12.586_bib0050
10.1016/j.proeng.2015.12.586_bib0060
10.1016/j.proeng.2015.12.586_bib0070
10.1016/j.proeng.2015.12.586_bib0080
10.1016/j.proeng.2015.12.586_bib0090
10.1016/j.proeng.2015.12.586_bib0105
10.1016/j.proeng.2015.12.586_bib0005
10.1016/j.proeng.2015.12.586_bib0015
10.1016/j.proeng.2015.12.586_bib0025
10.1016/j.proeng.2015.12.586_bib0035
10.1016/j.proeng.2015.12.586_bib0045
10.1016/j.proeng.2015.12.586_bib0100
10.1016/j.proeng.2015.12.586_bib0055
10.1016/j.proeng.2015.12.586_bib0010
10.1016/j.proeng.2015.12.586_bib0065
References_xml – reference: PSPLIB library : http://www.om-db.wi.tum.de/psplib/main.html.
– reference: J.A. Lawrence and B. Pasternack. Applied Management Science, John Wiley (2002).
– reference: P. Brucker and S. Knust. Complex Scheduling. GOR-Publications. Springer (2011).
– reference: R.L. Ackoff, C.W. Churchman and E.L. Arnoff. Introduction to Operational Research. John Wiley (1957).
– reference: APSP : https://www.dropbox.com/sh/9070da1dz6typ2o/V0jCAtR_8y.
– reference: T. Borreguero, Á. García, M. Ortega, A MILP Event Based Formulation for a Real-World Multimode RCSP with Generalized Temporal Constraints. Managing Complexity, Springer. (2014) pp 113-120.
– reference: C. Artigues, P. Michelon, and S. Reusser. Insertion techniques for static and dynamic resource-constrained project scheduling. European Journal of Operational Research, 149(2) (2003), pp. 249-267.
– reference: V. E. Gastelum. Application of lean manufacturing techniques for the design of the aircraft assembly line, Master's thesis. Massachusets Institute of Technology (2002).
– reference: T.A. Guldemond, J.L. Hurink, Time-constrained project scheduling, J. Scheduling 11 (2008) pp. 137-148.
– reference: O. Koné, C. Artigues, P. Lopez, M. Mongeau, Event-based MILP models for resource-constrained project scheduling problems, Computers & Operations Research 38 (1) (2011), pp. 3-13.
– reference: R. H. Mohring, Minimizing costs of resource requirements in project networks subject to a fixed completion time. Operations Research 32 (1) (1984) pp. 89-120.
– reference: S. Hartmann, D. Briskorn, A survey of variants and extensions of the resource-constrained project scheduling problem, European Journal of Operational Research 207 (1) (2010) pp. 1-14.
– reference: C. Artigues, S. Demassey, Resource-Constrained Project Scheduling: Models, Algorithms, Extensions and Applications, Wiley Library (2010).
– reference: P. Brucker, A. Drexl, R. Möhring, K. Neumann, and E. Pesch. Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research, 112(1) (1999), pp. 3-41.
– reference: J.M. Tamarit, R. Alvarez-Valdés. The project scheduling polyhedron: Dimension, facets and lifting theorems. European Journal of Operational Research, 67 (1993), pp. 204-220.
– reference: N. Nouri, S. Krichen, T. Ladhari, P. Fatimah, A discrete artificial bee colony algorithm for resource-constrained project scheduling problem. 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO) (2013) pp. 1-6.
– reference: J. Hurink, A. Kok, J. Paulus, J. Schutten, Time-constrained project scheduling with adjacent resources, Computers & Operations Research 38 (1) (2011) pp. 310-319.
– reference: H. Wang, T. Li, D. Lin, Efficient genetic algorithm for resource constrained project scheduling problem, Transactions of Tianjin University 16 (5) (2010) pp. 376-382.
– reference: A. Alan B. Pritsker, L.J. Watters, and P. M. Wolfe. Multiproject scheduling with limited resources: A zero-one programming approach. Management Science, 16(1)(1969), pp. 93-108.
– reference: GV. Reklaitis, JC. Zapata and BM. Hodge. The multimode resource constrained multiproject. scheduling problem: alternative formulations. AIChEJournal, 54(8) (2008) pp. 01-19.
– reference: O. Koné. Nouvelles approches pour la résolution du problème d’ordonnancement de projet a moyens limites. PhD thèsis, Université Toulouse III - Paul Sabatier (2009).
– ident: 10.1016/j.proeng.2015.12.586_bib0010
  doi: 10.1287/opre.32.1.89
– ident: 10.1016/j.proeng.2015.12.586_bib0080
  doi: 10.1287/mnsc.16.1.93
– ident: 10.1016/j.proeng.2015.12.586_bib0105
– ident: 10.1016/j.proeng.2015.12.586_bib0015
  doi: 10.1007/s10951-008-0059-7
– ident: 10.1016/j.proeng.2015.12.586_bib0005
– ident: 10.1016/j.proeng.2015.12.586_bib0100
– ident: 10.1016/j.proeng.2015.12.586_bib0035
  doi: 10.1016/j.ejor.2009.11.005
– ident: 10.1016/j.proeng.2015.12.586_bib0085
  doi: 10.1016/0377-2217(93)90062-R
– ident: 10.1016/j.proeng.2015.12.586_bib0060
– ident: 10.1016/j.proeng.2015.12.586_bib0065
– ident: 10.1016/j.proeng.2015.12.586_bib0020
  doi: 10.1016/j.cor.2010.05.006
– ident: 10.1016/j.proeng.2015.12.586_bib0040
  doi: 10.1007/s12209-010-1495-y
– ident: 10.1016/j.proeng.2015.12.586_bib0090
  doi: 10.1016/S0377-2217(02)00758-0
– ident: 10.1016/j.proeng.2015.12.586_bib0055
  doi: 10.1007/978-3-319-04705-8_13
– ident: 10.1016/j.proeng.2015.12.586_bib0025
  doi: 10.1007/978-3-642-23929-8
– ident: 10.1016/j.proeng.2015.12.586_bib0030
– ident: 10.1016/j.proeng.2015.12.586_bib0075
  doi: 10.1016/S0377-2217(98)00204-5
– ident: 10.1016/j.proeng.2015.12.586_bib0045
  doi: 10.1109/ICMSAO.2013.6552557
– ident: 10.1016/j.proeng.2015.12.586_bib0095
– ident: 10.1016/j.proeng.2015.12.586_bib0050
  doi: 10.1016/j.cor.2009.12.011
– ident: 10.1016/j.proeng.2015.12.586_bib0070
SSID ssj0000070251
Score 2.0271451
Snippet Scheduling is becoming much more important in every industry. At the same time, scheduling problems have been the subject of continuous research since the...
SourceID unpaywall
crossref
elsevier
SourceType Open Access Repository
Enrichment Source
Index Database
Publisher
StartPage 982
SubjectTerms Aerospace
Exact method
MILP Model
Scheduling
SummonAdditionalLinks – databaseName: Elsevier Free Content
  dbid: IXB
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEF5KL-pBfGJ9sQeva5PsJk2PtVhUUIRayC3sY1IqJZbSov33zuRRKggVj0l2s2F2M_vNMPt9jN34Sktrup4Az4BQzvpCR5khEYEwjsPQaVOwfb5EDyP1lIRJg_XrszBUVln5_tKnF966utOurNmeTSbtoU9Udl4YI6RRCkNn9MNSxSTf8JjcrfMsxGcTFCqM1F5Qh_oEXVHmhX4K8jHVeIWUFwzpUPXvO9TOMp_p1aeeTjd2oMEB26-gI--VX3fIGpAfsb0NQsFjlgxxDhwVl4_5JOcI7ngP5gi2y5Q1r4Q6VryoFOCaP0--wHFKC45hzjEwxYXPX0uRGT5APFupe52w0eD-rf8gKu0EYRFSLYTKukoBKB3jDwg28mLQJghcRzrfaBtIANDdLMMAIYhNx_kqc1YpS_Q31hkpT1kz_8jhjPEsAnwauTjSmbK4wRsAUr-TGEnhW7MWk7W9UlsRi5O-xTStK8je09LKKVk59YMUrdxiYt1rVhJrbGnfqaci_bFAUvT9W3rermfuT0Od_3uoC7ZLV2WK5pI1F_MlXCFoWZjrYlV-Ayvx7C0
  priority: 102
  providerName: Elsevier
Title Scheduling in the Aeronautical Industry Using a Mixed Integer Linear Problem Formulation
URI https://dx.doi.org/10.1016/j.proeng.2015.12.586
https://doi.org/10.1016/j.proeng.2015.12.586
UnpaywallVersion publishedVersion
Volume 132
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAFT
  databaseName: Open Access Digital Library
  customDbUrl:
  eissn: 1877-7058
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000070251
  issn: 1877-7058
  databaseCode: KQ8
  dateStart: 20090701
  isFulltext: true
  titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html
  providerName: Colorado Alliance of Research Libraries
– providerCode: PRVESC
  databaseName: Elsevier Free Content
  customDbUrl:
  eissn: 1877-7058
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000070251
  issn: 1877-7058
  databaseCode: IXB
  dateStart: 20090701
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1877-7058
  dateEnd: 20181231
  omitProxy: true
  ssIdentifier: ssj0000070251
  issn: 1877-7058
  databaseCode: M~E
  dateStart: 20090101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVLSH
  databaseName: Elsevier Journals
  customDbUrl:
  mediaType: online
  eissn: 1877-7058
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000070251
  issn: 1877-7058
  databaseCode: AKRWK
  dateStart: 20090701
  isFulltext: true
  providerName: Library Specific Holdings
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB5sPYgH36KiZQ8eTWmSTbI9VmmpQkXQQj2FfUxKtcRSUnwc_O3ONklRQVovuSSTLDOz2W9mZ-cDOHe59LVqNhxsKHS40a4jw0RZEoFAiCAwUs27fd6G3T6_GQSDNbgoz8L82L-f12HRjwTToS3CCmziLhBhBdbDgJB3Fdb7t3etRxtTiShyokYgytNxf4j-tfpszNKJfH-V4_G31aWzDb1yXHlRyXN9lqm6_vjVsnHVge_AVgEzWSv3i11Yw3QPNr81H9yHwT3Zy9hC9CEbpYyAIGvhlIB5nt5mBanHO5tXFTDJeqM3NMymEIc4ZRTE0iRhdzkhDesQ9i2YwA6g32k_XHWdgmfB0QS_MocnTc4RuRQ0WVGHDYFSeZ6JfOMqqT0fEWUzSSiY8ISKjMsToznXtlWONsr3D6GavqR4BCwJke6GRoQy4ZrAgEK0THk-RV301uQY_FL_sS6akFsujHFcVps9xbneYqu32PVi0tsxOAupSd6EY8nzUWnauAASOUCIyUpLJOsLT1jpUyf_FTiFajad4RlBmUzVoHI9uKRr77NdK7z5C97B9oY
linkProvider Unpaywall
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEF6qHtSD-MT63IPX2CbZpOlRxVK1LUJb6G3Zx6RESiylRfvvncmjKAgVr9lMNszuzn4zzMzH2I0rlG90s-5AXYMjrHEdFcaaSASCKAoCq3TW7bMXtofieRSMKuyhrIWhtMrC9uc2PbPWxZNaoc3aNElqfZda2dWDCCGNEOg6b7AtESA6oSq-0f0q0EINbbyMhpEEHJIoS-iyPC80VJCOKckroMBgQFXVv19R24t0qpYfajL5dgW19tlegR35Xf57B6wC6SHb_dZR8IiN-rgIlrLLxzxJOaI7fgczRNt5zJoXTB1LnqUKcMW7ySdYTnHBMcw4eqa48_lrzjLDWwhoC3qvYzZsPQ4e2k5BnuAYxFRzR8RNIQCEivAEggnrESjtebbhW1cr4_kAoJpxjB6CF-mGdUVsjRCG-t8Yq33_hG2m7ymcMh6HgKOhjUIVC4M3vAYg-jsfXSn8alxlfqkvaYrO4kRwMZFlCtmbzLUsScvS9SRqucqcldQ076yx5v1GuRTyxw6RaPzXSN6uVu5PU539e6prtt0edDuy89R7OWc7NJLHay7Y5ny2gEtEMHN9le3QLyOQ71M
linkToUnpaywall http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEF5qexAPvsWKyh48mpLHbrI9FrEUoaWghXoK-5iUaomlpGj99c42SalCaT0nkywzs9lvNrPfR8idx2SgVdN1wFXgMKM9R4aJsiICXAjOjVRLts9e2BmwpyEfVsh9eRbm1__7ZR8WfkggHdkmLG437rgI90gt5Ii8q6Q26PVbr7amElHkRC4X5em4DaabVp_9eTqVi085maytLu0j0i3HlTeVvDfmmWro7z-UjbsO_JgcFjCTtvK8OCEVSE_JwRr54BkZPmO8jG1EH9FxShEI0hbMEJjn29u0EPVY0GVXAZW0O_4CQ-0W4ghmFItYnCS0nwvS0DZi30IJ7JwM2o8vDx2n0FlwNMKvzGFJkzEAJgVOVtChK0Aq3zdRYDwltR8AgGwmCRYTvlCR8VhiNGPaUuVoo4LgglTTjxQuCU1CwKuhEaFMmEYwoACsUl6AVRc-NamToPR_rAsScquFMYnLbrO3OPdbbP0We36MfqsTZ2U1zUk4ttwflaGNCyCRA4QYo7TFsrHKhJ1edfVfg2tSzWZzuEEok6nbIoN_AGFb9FE
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Scheduling+in+the+Aeronautical+Industry+Using+a+Mixed+Integer+Linear+Problem+Formulation&rft.jtitle=Procedia+engineering&rft.au=Borreguero%2C+T.&rft.au=Garc%C3%ADa%2C+A.&rft.au=Ortega%2C+M.&rft.date=2015&rft.issn=1877-7058&rft.eissn=1877-7058&rft.volume=132&rft.spage=982&rft.epage=989&rft_id=info:doi/10.1016%2Fj.proeng.2015.12.586&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_proeng_2015_12_586
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1877-7058&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1877-7058&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1877-7058&client=summon