A robust optimization model for multi-objective multi-period supply chain planning under uncertainty considering quantity discounts

This paper addresses a new robust multi-objective multi-period model for supply chain planning under uncertainty considering quantity discounts. The proposed model maximizes the current profit of the distributor by making a balance between the total costs of the supply chain and the distributor comp...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of industrial and production engineering Ročník 35; číslo 4; s. 214 - 228
Hlavní autori: Rahimi, Erfan, Paydar, Mohammad Mahdi, Mahdavi, Iraj, Jouzdani, Javid, Arabsheybani, Amir
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Abingdon Taylor & Francis Ltd 19.05.2018
Predmet:
ISSN:2168-1015, 2168-1023
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract This paper addresses a new robust multi-objective multi-period model for supply chain planning under uncertainty considering quantity discounts. The proposed model maximizes the current profit of the distributor by making a balance between the total costs of the supply chain and the distributor company's revenues of selling products and also maximizes the company's expected profit by introducing brands and taking the risk of loss on it. Considering uncertainty in the purchasing cost, selling fees, and demand fluctuations, the new robust multi-objective mixed-integer programming model is solved as a single-objective mixed-integer programming model by utilizing the LP-metrics method. By settling regulatory penalty parameters and considering different economic scenarios, the robustness and effectiveness of the developed model are verified with the data from BEH PAKHSH Company, a commodities distributor in Iran. The outcomes show that the proposed model is a promising approach to run an efficient supply chain.
AbstractList This paper addresses a new robust multi-objective multi-period model for supply chain planning under uncertainty considering quantity discounts. The proposed model maximizes the current profit of the distributor by making a balance between the total costs of the supply chain and the distributor company's revenues of selling products and also maximizes the company's expected profit by introducing brands and taking the risk of loss on it. Considering uncertainty in the purchasing cost, selling fees, and demand fluctuations, the new robust multi-objective mixed-integer programming model is solved as a single-objective mixed-integer programming model by utilizing the LP-metrics method. By settling regulatory penalty parameters and considering different economic scenarios, the robustness and effectiveness of the developed model are verified with the data from BEH PAKHSH Company, a commodities distributor in Iran. The outcomes show that the proposed model is a promising approach to run an efficient supply chain.
Author Jouzdani, Javid
Mahdavi, Iraj
Rahimi, Erfan
Paydar, Mohammad Mahdi
Arabsheybani, Amir
Author_xml – sequence: 1
  givenname: Erfan
  surname: Rahimi
  fullname: Rahimi, Erfan
  organization: Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol - Iran
– sequence: 2
  givenname: Mohammad Mahdi
  surname: Paydar
  fullname: Paydar, Mohammad Mahdi
  organization: Department of Industrial Engineering, Babol Noshirvani University of Technology, Babol, Iran
– sequence: 3
  givenname: Iraj
  surname: Mahdavi
  fullname: Mahdavi, Iraj
  organization: Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol - Iran
– sequence: 4
  givenname: Javid
  surname: Jouzdani
  fullname: Jouzdani, Javid
  organization: Department of Industrial Engineering, Golpayegan University of Technology, Golpayegan, Iran
– sequence: 5
  givenname: Amir
  surname: Arabsheybani
  fullname: Arabsheybani, Amir
  organization: Department of Industrial Engineering, Babol Noshirvani University of Technology, Babol, Iran
BookMark eNqFkEtPAyEUhYmpibX2J5iQuJ7KZZ6Nq6bxlTRxo2vCAKM0MzAFxqRu_eMytrpwIwsunHvOJXznaGKsUQhdAlkAqcg1haICAvmCEqgWkGUAy_wETUc9AULTye8Z8jM0935L4qpyGr1T9LnCztaDD9j2QXf6gwdtDe6sVC1urMPd0Aad2HqrRNDv6njvldNWYj_0fbvH4o1rg_uWG6PNKx6MVC7uQrkQGyEarPE6imN3N3ATdBSl9sIOJvgLdNrw1qv5sc7Qy93t8_oh2TzdP65Xm0TQCkL8QC5p1qhCpGlJCNBaFrWoK541MuUlSFkQIXPJ07yuy5KXMlWUKrLkRCkAlc7Q1WFu7-xuUD6wrR2ciU8ySsaRWRrrDN0cXMJZ751qmNDhm0pwXLcMCBvBsx_wbATPjuBjOv-T7p3uuNv_k_sChl-LwQ
CitedBy_id crossref_primary_10_4018_IJRCM_2019070103
crossref_primary_10_1007_s12351_020_00615_0
crossref_primary_10_1016_j_cie_2021_107169
crossref_primary_10_1080_21681015_2025_2472941
crossref_primary_10_1016_j_ijpe_2019_07_007
Cites_doi 10.1016/j.tre.2014.06.003
10.1016/j.apm.2013.10.029
10.1016/j.ejor.2005.05.032
10.1287/moor.23.4.769
10.1016/j.ejor.2004.01.046
10.1016/j.ijpe.2013.12.023
10.1016/j.compchemeng.2017.04.005
10.1016/j.ijpe.2011.01.027
10.1016/j.apm.2016.03.015
10.1016/j.ejor.2006.06.011
10.1016/j.compchemeng.2003.09.017
10.1287/opre.43.2.264
10.1007/s10107-003-0396-4
10.1287/moor.1080.0352
10.1080/0951192X.2013.834476
10.1016/j.cor.2009.06.017
10.1016/j.ejor.2005.07.035
10.1016/j.apm.2016.03.047
10.1287/opre.1030.0065
10.1016/j.ejor.2009.03.041
10.1057/palgrave.jors.2602075
10.1080/0951192X.2013.874596
10.1287/opre.43.3.477
10.1016/j.jmsy.2014.08.003
10.1504/IJADS.2014.063231
10.1016/j.cor.2014.12.014
10.1016/S0305-0548(99)00078-7
10.1080/00207548908942611
10.1287/mnsc.43.7.895
10.1007/s10107-005-0677-1
10.1016/j.ejor.2006.01.034
10.1016/S0925-5273(99)00074-2
10.1108/09600030710742425
10.1007/PL00011380
10.1016/S0360-8352(00)00029-2
10.1016/j.ejor.2001.12.001
ContentType Journal Article
Copyright 2018 Chinese Institute of Industrial Engineers
Copyright_xml – notice: 2018 Chinese Institute of Industrial Engineers
DBID AAYXX
CITATION
7SC
7TB
8FD
FR3
JQ2
L7M
L~C
L~D
DOI 10.1080/21681015.2018.1441195
DatabaseName CrossRef
Computer and Information Systems Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList Technology Research Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2168-1023
EndPage 228
ExternalDocumentID 10_1080_21681015_2018_1441195
GroupedDBID .QJ
0BK
0R~
30N
4.4
AAENE
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
AAYXX
ABDBF
ABFIM
ABLIJ
ABPAQ
ABPEM
ABXUL
ABXYU
ACIWK
ACTIO
ACUHS
ADCVX
ADGTB
ADMLS
AEISY
AEOZL
AEPSL
AEYOC
AFRVT
AGDLA
AGMYJ
AHDZW
AIJEM
AIYEW
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AQRUH
AVBZW
BLEHA
CCCUG
CITATION
DGEBU
DKSSO
EBS
EJD
ESX
E~A
E~B
H13
IPNFZ
KYCEM
M4Z
MK~
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TTHFI
TUROJ
TUS
UT5
ZGOLN
~S~
7SC
7TB
8FD
FR3
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c281t-105d24fe6c3370012bd6bcb8a4fd3a71dd60cd5da35bb77a7d3e22e09a0ee11e3
ISICitedReferencesCount 9
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000433511400002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2168-1015
IngestDate Wed Aug 13 03:42:27 EDT 2025
Sat Nov 29 04:18:50 EST 2025
Tue Nov 18 21:09:46 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 4
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c281t-105d24fe6c3370012bd6bcb8a4fd3a71dd60cd5da35bb77a7d3e22e09a0ee11e3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 2037004320
PQPubID 436410
PageCount 15
ParticipantIDs proquest_journals_2037004320
crossref_citationtrail_10_1080_21681015_2018_1441195
crossref_primary_10_1080_21681015_2018_1441195
PublicationCentury 2000
PublicationDate 2018-05-19
PublicationDateYYYYMMDD 2018-05-19
PublicationDate_xml – month: 05
  year: 2018
  text: 2018-05-19
  day: 19
PublicationDecade 2010
PublicationPlace Abingdon
PublicationPlace_xml – name: Abingdon
PublicationTitle Journal of industrial and production engineering
PublicationYear 2018
Publisher Taylor & Francis Ltd
Publisher_xml – name: Taylor & Francis Ltd
References CIT0030
CIT0010
CIT0032
CIT0031
CIT0012
CIT0011
CIT0033
Love S (CIT0034) 1979
Hajian Heidary M (CIT0029) 2015; 22
CIT0014
CIT0036
CIT0013
CIT0035
CIT0016
CIT0038
CIT0015
CIT0037
CIT0018
CIT0017
CIT0039
CIT0019
Kall P (CIT0005) 2005
CIT0021
CIT0020
CIT0001
CIT0022
CIT0003
CIT0025
CIT0002
CIT0024
Ben-Tal A (CIT0023) 1999; 25
CIT0027
CIT0004
CIT0026
CIT0007
CIT0006
CIT0028
CIT0009
CIT0008
References_xml – ident: CIT0039
  doi: 10.1016/j.tre.2014.06.003
– ident: CIT0007
  doi: 10.1016/j.apm.2013.10.029
– ident: CIT0015
  doi: 10.1016/j.ejor.2005.05.032
– ident: CIT0022
  doi: 10.1287/moor.23.4.769
– ident: CIT0014
  doi: 10.1016/j.ejor.2004.01.046
– ident: CIT0006
  doi: 10.1016/j.ijpe.2013.12.023
– ident: CIT0016
  doi: 10.1016/j.compchemeng.2017.04.005
– ident: CIT0010
  doi: 10.1016/j.ijpe.2011.01.027
– ident: CIT0031
  doi: 10.1016/j.apm.2016.03.015
– ident: CIT0004
  doi: 10.1016/j.ejor.2006.06.011
– ident: CIT0003
  doi: 10.1016/j.compchemeng.2003.09.017
– ident: CIT0017
  doi: 10.1287/opre.43.2.264
– ident: CIT0019
  doi: 10.1007/s10107-003-0396-4
– volume: 25
  start-page: 1
  issue: 1
  year: 1999
  ident: CIT0023
  publication-title: Math Operations Res
  doi: 10.1287/moor.1080.0352
– ident: CIT0027
  doi: 10.1080/0951192X.2013.834476
– ident: CIT0011
  doi: 10.1016/j.cor.2009.06.017
– ident: CIT0013
  doi: 10.1016/j.ejor.2005.07.035
– ident: CIT0030
  doi: 10.1016/j.apm.2016.03.047
– ident: CIT0020
  doi: 10.1287/opre.1030.0065
– ident: CIT0009
  doi: 10.1016/j.ejor.2009.03.041
– ident: CIT0026
  doi: 10.1057/palgrave.jors.2602075
– ident: CIT0032
  doi: 10.1080/0951192X.2013.874596
– ident: CIT0033
  doi: 10.1287/opre.43.3.477
– ident: CIT0008
  doi: 10.1016/j.jmsy.2014.08.003
– ident: CIT0025
  doi: 10.1504/IJADS.2014.063231
– ident: CIT0028
  doi: 10.1016/j.cor.2014.12.014
– ident: CIT0036
  doi: 10.1016/S0305-0548(99)00078-7
– ident: CIT0002
  doi: 10.1080/00207548908942611
– ident: CIT0018
  doi: 10.1287/mnsc.43.7.895
– ident: CIT0021
  doi: 10.1007/s10107-005-0677-1
– ident: CIT0037
  doi: 10.1016/j.ejor.2006.01.034
– ident: CIT0038
  doi: 10.1016/S0925-5273(99)00074-2
– ident: CIT0001
  doi: 10.1108/09600030710742425
– ident: CIT0024
  doi: 10.1007/PL00011380
– volume: 22
  start-page: 2634
  year: 2015
  ident: CIT0029
  publication-title: Scientia Iranica
– ident: CIT0035
  doi: 10.1016/S0360-8352(00)00029-2
– volume-title: Stochastic linear programming
  year: 2005
  ident: CIT0005
– ident: CIT0012
  doi: 10.1016/j.ejor.2001.12.001
– volume-title: Inventory control
  year: 1979
  ident: CIT0034
SSID ssj0000852144
Score 2.1376157
Snippet This paper addresses a new robust multi-objective multi-period model for supply chain planning under uncertainty considering quantity discounts. The proposed...
SourceID proquest
crossref
SourceType Aggregation Database
Enrichment Source
Index Database
StartPage 214
SubjectTerms Commodities
Discounts
Economic models
Food processing industry
Integer programming
Mathematical programming
Multiple objective analysis
Optimization models
Robustness
Supply chains
Uncertainty
Variation
Title A robust optimization model for multi-objective multi-period supply chain planning under uncertainty considering quantity discounts
URI https://www.proquest.com/docview/2037004320
Volume 35
WOSCitedRecordID wos000433511400002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAWR
  databaseName: Taylor & Francis
  customDbUrl:
  eissn: 2168-1023
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000852144
  issn: 2168-1015
  databaseCode: TFW
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF6FwgEOiKcoFLQHeopcbK8d28cIGgEKoQcXcrP2FSVVE6d5qeHKL-YfMLO7jl0orwMXK1l7N7bny-xo95v5CHkpYwnzqBSejnzlRUpmnuCp8EYw9bKQi0yaLP5P_WQwSIfD7KTV-lblwmzOk9ksvbzM5v_V1NAGxsbU2X8w925QaIDPYHQ4gtnh-FeG77YXpVgvV-0SvMHUpVlaxRvDKTQUQq8UZ9bVue9Y8LhU7SWKfG4xHRjZ5U7QyGjlLuAoLX8A4nbpdD7x7MWaY67vFjd7jPTE8hcR76SWCbHlCUyxWbw7XVdFrDeexnD31lWPagif8K2ynPAP5ZhPpxxpImM1qVfWx4pvTL93C35WE4TWX5SVr2q_39H43WpHkOJGfcOn5j8JjzTYT-Azw6CD1WpthuiRbrbZtObK6dsaKQ7c0RUPHl07s1gqJo6FwyMnMMWNcayYV0-lFX1g8LHonfb7RX48zA9Zb37hocwZ0gEO2RsLuRvkZpjEGbIQ897n3bIgRMBYxA4lEatHqfLOUv_VtT9_NaK6GlCYKCm_R-46Y9OuheV90tKzB-ROo-jlQ_K1Sy1AaROg1ACUAkDpDwClTYBSC1BqAEorgFIDUNoAKG0AlFYApTuAPiKnveP89VvPSYF4MkyDFbyHWIXRSHckY8iUCIXqCClSHo0U40mgFDgcFSvOYiGShCeK6TDUfsZ9rYNAs8dkb1bO9BNCtWC-4AqukGkk0yyNdRaNwCv5gcqkH-yTqHqdhXR18lGu5bwIXDndygoFWqFwVtgnR7tuc1so5k8dDipbFc59LOECfLyIhf7T359-Rm7Xf48DsrdarPVzcktuVpPl4oXB1HdvtsVj
linkProvider Taylor & Francis
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=A+robust+optimization+model+for+multi-objective+multi-period+supply+chain+planning+under+uncertainty+considering+quantity+discounts&rft.jtitle=Journal+of+industrial+and+production+engineering&rft.au=Rahimi%2C+Erfan&rft.au=Paydar%2C+Mohammad+Mahdi&rft.au=Mahdavi%2C+Iraj&rft.au=Jouzdani%2C+Javid&rft.date=2018-05-19&rft.pub=Taylor+%26+Francis+Ltd&rft.issn=2168-1015&rft.eissn=2168-1023&rft.volume=35&rft.issue=4&rft.spage=214&rft_id=info:doi/10.1080%2F21681015.2018.1441195&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2168-1015&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2168-1015&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2168-1015&client=summon