The green capacitated multi-item lot sizing problem with parallel machines

•We propose a mixed integer programming model for the green capacitated multi-item lot sizing problem with parallel machines.•The mathematical model can support the reduction of carbon emissions for manufacturing companies.•The green lot sizing problem is NP-hard and is therefore difficult to solve....

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & operations research Jg. 98; S. 149 - 164
Hauptverfasser: Wu, Tao, Xiao, Fan, Zhang, Canrong, He, Yan, Liang, Zhe
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Elsevier Ltd 01.10.2018
Pergamon Press Inc
Schlagworte:
ISSN:0305-0548, 1873-765X, 0305-0548
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract •We propose a mixed integer programming model for the green capacitated multi-item lot sizing problem with parallel machines.•The mathematical model can support the reduction of carbon emissions for manufacturing companies.•The green lot sizing problem is NP-hard and is therefore difficult to solve.•We apply a progressive selection heuristic to find feasible solutions and upper bounds for the problem.•We also apply Lagrangian-relaxation, Dantzig–Wolfe decomposition, and column generation to enhance lower bounds for quantifying the solution quality. Carbon emissions related to energy consumptions from the manufacturing industry have become a substantial part of environmental burdens. To reduce carbon emissions, we introduce carbon emission constraints into the capacitated multi-item lot sizing problem with nonidentical parallel machines. The problem aims to satisfy customer demand for various items over the planning horizon, with an objective to minimize total costs without violating the capacity and carbon emission constraints. We formulate the problem with a mixed integer programming model and propose Lagrangian relaxation and column generation methods to improve lower bounds over the linear programming relaxation. Furthermore, we apply a heuristic named progressive selection to solve the problem and compare the heuristic with other state-of-the-art approaches in the literature. Computational results indicate that the progressive selection heuristic is computationally tractable and can obtain superior results under the same computational resources.
AbstractList Carbon emissions related to energy consumptions from the manufacturing industry have become a substantial part of environmental burdens. To reduce carbon emissions, we introduce carbon emission constraints into the capacitated multi-item lot sizing problem with nonidentical parallel machines. The problem aims to satisfy customer demand for various items over the planning horizon, with an objective to minimize total costs without violating the capacity and carbon emission constraints. We formulate the problem with a mixed integer programming model and propose Lagrangian relaxation and column generation methods to improve lower bounds over the linear programming relaxation. Furthermore, we apply a heuristic named progressive selection to solve the problem and compare the heuristic with other state-of-the-art approaches in the literature. Computational results indicate that the progressive selection heuristic is computationally tractable and can obtain superior results under the same computational resources.
•We propose a mixed integer programming model for the green capacitated multi-item lot sizing problem with parallel machines.•The mathematical model can support the reduction of carbon emissions for manufacturing companies.•The green lot sizing problem is NP-hard and is therefore difficult to solve.•We apply a progressive selection heuristic to find feasible solutions and upper bounds for the problem.•We also apply Lagrangian-relaxation, Dantzig–Wolfe decomposition, and column generation to enhance lower bounds for quantifying the solution quality. Carbon emissions related to energy consumptions from the manufacturing industry have become a substantial part of environmental burdens. To reduce carbon emissions, we introduce carbon emission constraints into the capacitated multi-item lot sizing problem with nonidentical parallel machines. The problem aims to satisfy customer demand for various items over the planning horizon, with an objective to minimize total costs without violating the capacity and carbon emission constraints. We formulate the problem with a mixed integer programming model and propose Lagrangian relaxation and column generation methods to improve lower bounds over the linear programming relaxation. Furthermore, we apply a heuristic named progressive selection to solve the problem and compare the heuristic with other state-of-the-art approaches in the literature. Computational results indicate that the progressive selection heuristic is computationally tractable and can obtain superior results under the same computational resources.
Author Wu, Tao
Xiao, Fan
He, Yan
Liang, Zhe
Zhang, Canrong
Author_xml – sequence: 1
  givenname: Tao
  orcidid: 0000-0001-7954-485X
  surname: Wu
  fullname: Wu, Tao
  email: danielwu9999@gmail.com, twu1@dow.com
  organization: Advanced Analytics Department, Dow Chemical, Midland, MI 48642, USA
– sequence: 2
  givenname: Fan
  surname: Xiao
  fullname: Xiao, Fan
  email: 1631022@tongji.edu.cn
  organization: School of Economics & Management, Tongji University, Shanghai 200092, China
– sequence: 3
  givenname: Canrong
  surname: Zhang
  fullname: Zhang, Canrong
  email: crzhang@sz.tsinghua.edu.cn
  organization: Logistics Engineering and Simulation Laboratory, Graduate School at Shenzhen, Tsinghua University, Shenzhen 518055, China
– sequence: 4
  givenname: Yan
  surname: He
  fullname: He, Yan
  email: heyan@cqu.edu.cn
  organization: State Key Laboratory of Mechanical Transmission, Chongqing University, Chongqing 400030, China
– sequence: 5
  givenname: Zhe
  surname: Liang
  fullname: Liang, Zhe
  email: liangzhe@tongji.edu.cn
  organization: School of Economics & Management, Tongji University, Shanghai 200092, China
BookMark eNp9kDtPwzAQgC1UJNrCD2CLxJxwduI4EROqeKoSS5HYLNe5tI7ywnZB8OtxKRNDbznpdN89vhmZ9EOPhFxSSCjQ_LpJ9GATBrRIgCfAshMypYVIY5HztwmZQgo8Bp4VZ2TmXAMhBKNT8rzaYrSxiH2k1ai08cpjFXW71pvYeOyidvCRM9-m30SjHdZtKH0av41GZVXbYht1Sm9Nj-6cnNaqdXjxl-fk9f5utXiMly8PT4vbZaxTLnycYVlXmudclBwFUM7yVNd1qmHNkJWYC02ZqjFHwSFFSjXXiCVgiqyADNM5uTrMDee879B52Qw724eVklFKOc8gZ6GLHrq0HZyzWMvRmk7ZL0lB7pXJRgZlcq9MApdBWWDEP-bXhxl6b5Vpj5I3BxLD4x8GrXTaYK-xMha1l9VgjtA_DvOIaA
CitedBy_id crossref_primary_10_1016_j_ejor_2021_09_043
crossref_primary_10_1007_s00291_022_00699_4
crossref_primary_10_1016_j_trpro_2025_03_115
crossref_primary_10_1016_j_cie_2021_107456
crossref_primary_10_1016_j_compind_2024_104131
crossref_primary_10_1007_s10479_023_05610_0
crossref_primary_10_1016_j_omega_2024_103092
crossref_primary_10_3390_math13111798
crossref_primary_10_1007_s10668_023_04034_x
crossref_primary_10_1007_s10732_024_09539_w
crossref_primary_10_1007_s11356_022_24995_2
crossref_primary_10_1108_JM2_10_2018_0169
crossref_primary_10_1016_j_ejor_2020_04_043
crossref_primary_10_1080_00207543_2023_2300739
crossref_primary_10_1109_TEM_2022_3230752
crossref_primary_10_1016_j_cor_2024_106865
crossref_primary_10_1016_j_ejor_2022_03_012
crossref_primary_10_1016_j_cor_2023_106502
crossref_primary_10_1109_TASE_2024_3418370
crossref_primary_10_1016_j_cor_2020_105068
crossref_primary_10_1016_j_cor_2024_106555
crossref_primary_10_1016_j_cor_2024_106962
crossref_primary_10_1016_j_eswa_2022_117916
Cites_doi 10.1007/s10479-011-1026-9
10.1016/j.tre.2014.04.012
10.1287/inte.15.2.10
10.1016/j.ejor.2012.11.044
10.1109/TASE.2012.2203304
10.1016/j.ejor.2012.05.004
10.1016/j.ifacol.2017.08.1580
10.1038/nclimate1332
10.1007/s10107-004-0570-3
10.1287/ijoc.2014.0636
10.1016/j.omega.2015.03.002
10.1287/mnsc.26.7.669
10.1016/0166-218X(86)90061-2
10.1016/j.cor.2013.01.021
10.1016/j.ijpe.2015.08.024
10.1016/j.cor.2008.10.009
10.1287/ijoc.2016.0691
10.1007/s10107-003-0395-5
10.1287/mnsc.5.1.89
10.1287/mnsc.46.5.724.12048
10.1287/opre.1050.0234
10.1016/j.ejor.2005.06.029
10.1287/ijoc.6.4.445
10.1007/s00291-008-0150-7
10.1287/mnsc.35.3.353
10.1016/j.orl.2012.12.003
10.1016/j.jclepro.2014.10.006
10.1287/mnsc.11.9.874
10.1287/mnsc.42.5.738
10.1016/j.ejor.2011.04.029
10.1287/opre.51.3.487.14949
10.1016/j.ejor.2015.07.052
10.1287/opre.1070.0404
10.1007/s10732-015-9295-0
10.1177/0954405411417673
10.1287/mnsc.4.2.115
10.1287/mnsc.49.8.1039.16406
10.1007/s10696-012-9170-3
10.1287/ijoc.2017.0777
10.1287/ijoc.2016.0712
10.1016/j.ijpe.2009.08.022
10.1016/j.ejor.2014.06.030
10.1016/j.orl.2003.06.001
10.1287/ijoc.2017.0746
10.1016/j.ejor.2011.05.014
10.1016/j.ejor.2017.05.008
10.1080/10556780902992837
10.1287/mnsc.27.1.1
10.1016/j.cor.2015.04.015
10.1080/00207543.2013.836615
10.4018/jgc.2010010104
10.1016/j.ijpe.2011.03.024
ContentType Journal Article
Copyright 2018 Elsevier Ltd
Copyright Pergamon Press Inc. Oct 2018
Copyright_xml – notice: 2018 Elsevier Ltd
– notice: Copyright Pergamon Press Inc. Oct 2018
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/j.cor.2018.05.024
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology 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
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts

DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
Business
EISSN 1873-765X
0305-0548
EndPage 164
ExternalDocumentID 10_1016_j_cor_2018_05_024
S0305054818301539
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
186
1B1
1OL
1RT
1~.
1~5
29F
4.4
457
4G.
5GY
5VS
6J9
7-5
71M
8P~
9JN
9JO
AAAKF
AAAKG
AABNK
AACTN
AAEDT
AAEDW
AAFJI
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AARIN
AAXUO
AAYFN
AAYOK
ABAOU
ABBOA
ABEFU
ABFNM
ABFRF
ABJNI
ABMAC
ABMMH
ABUCO
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFO
ACGFS
ACNCT
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADGUI
ADJOM
ADMUD
AEBSH
AEFWE
AEHXG
AEKER
AENEX
AFFNX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AI.
AIALX
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
AKYCK
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOMHK
AOUOD
APLSM
ARUGR
ASPBG
AVARZ
AVWKF
AXJTR
AZFZN
BKOJK
BKOMP
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
G8K
GBLVA
GBOLZ
HAMUX
HVGLF
HZ~
H~9
IHE
J1W
KOM
LY1
M41
MHUIS
MO0
MS~
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
PRBVW
Q38
R2-
RIG
ROL
RPZ
RXW
SDF
SDG
SDP
SDS
SES
SEW
SPC
SPCBC
SSB
SSD
SSO
SSV
SSW
SSZ
T5K
TAE
TN5
U5U
UAO
UPT
VH1
WUQ
XFK
XPP
ZMT
~02
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
7SC
8FD
AGCQF
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c357t-4e9fdc565795e7015263cff3c0b2e29e67c12afe6e7503e11c5cee90e3e2804e3
ISICitedReferencesCount 24
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000440526800012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0305-0548
IngestDate Wed Aug 13 06:05:01 EDT 2025
Sat Nov 29 03:23:41 EST 2025
Tue Nov 18 22:37:53 EST 2025
Fri Feb 23 02:32:28 EST 2024
IsPeerReviewed true
IsScholarly true
Keywords Green manufacturing
Column generation
Production planning
Lagrangian relaxation
Lot sizing
Energy consumptions
Carbon emissions
Heuristic
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c357t-4e9fdc565795e7015263cff3c0b2e29e67c12afe6e7503e11c5cee90e3e2804e3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0001-7954-485X
PQID 2111554062
PQPubID 45870
PageCount 16
ParticipantIDs proquest_journals_2111554062
crossref_primary_10_1016_j_cor_2018_05_024
crossref_citationtrail_10_1016_j_cor_2018_05_024
elsevier_sciencedirect_doi_10_1016_j_cor_2018_05_024
PublicationCentury 2000
PublicationDate 2018-10-01
PublicationDateYYYYMMDD 2018-10-01
PublicationDate_xml – month: 10
  year: 2018
  text: 2018-10-01
  day: 01
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle Computers & operations research
PublicationYear 2018
Publisher Elsevier Ltd
Pergamon Press Inc
Publisher_xml – name: Elsevier Ltd
– name: Pergamon Press Inc
References Benjaafar, Li, Daskin (bib0007) 2013; 10
Lang, Shen (bib0033) 2011; 214
Pochet, Y., Wolsey, L.A., eds. 2006. Production planning by mixed integer programming. Springer.
Stadtler (bib0045) 2003; 51
Degraeve, Jans (bib0013) 2007; 55
Toledo, Armentano (bib0049) 2006; 175
Roshani, Giglio, Paolucci (bib0040) 2017; 50
He, Li, Wu, Sutherland (bib0025) 2015; 87
Wu, Zhang, Liang, Leung (bib0060) 2013; 40
Fahle, Schamberger, Sellmann (bib0015) 2001; vol. 2239
Helmrich, Jans, Heuvel, Wagelmans (bib0029) 2015; 24
Helber, Sahling (bib0028) 2010; 123
Fischetti, Lodi (bib0019) 2003; 98
Tempelmeier, Derstroff (bib0098) 1996; 42
Wu, Shi, Song (bib0059) 2012; 196
Spiller (bib0044) 2015; 27
Konur, Schaefer (bib0032) 2014; 68
Protocol (bib0062) 1997; 19
Toledo, da Silva Arantes, Hossomi, França, Akartunalı (bib0048) 2015; 21
Absi, Dauzere-Peres, Kedad-Sidhoum, Penz, Rapine (bib0002) 2016; 248
Akbalik, Rapine (bib0004) 2014
Dzielinski, Gomory (bib0014) 1965; 11
Fischetti, Glover, Lodi (bib0018) 2005; 104
Savelsbergh (bib0043) 1994; 6
He, Liu, Wu, Zhong, Peng (bib0026) 2012; 226
Heck, Schmidt (bib0027) 2010; 1
Fisher (bib0020) 1981; 27
Wolsey (bib0055) 1998
Liang, He, Wu, Zhang (bib0034) 2015; 170
Brahimi, Absi, Dauzère-Pérès, Nordli (bib0009) 2017; 263
Yu, Hong, Chu, Liang (bib0061) 2013
Bouchery, Ghaffari, Jemai, Dallery (bib0008) 2012; 222
Lübbecke, Desrosiers (bib0035) 2005; 53
Fiorotto, Araujo, Jans (bib0017) 2015; 63
Toptal, Özlü, Konur (bib0050) 2014; 52
Akartunalı, Fragkos, Miller, Wu (bib0003) 2016; 28
Wu, Liang, Zhang (bib0057) 2018; 30
Wu, Akartunalı, Jans, Liang (bib0056) 2017; 29
Peters, Marland, Quere, Boden, Canadell, Raupach (bib0037) 2012; 2
Wu, Shi, Akartunalı, Geunes (bib0058) 2011; 214
Trigeiro, Thomas, John (bib0051) 1989; 35
Belvaux, Wolsey (bib0006) 2000; 46
Buschkühl, Sahling, Helber, Tempelmeier (bib0010) 2010; 32
de Araujo, Reyck, Degraeve, Fragkos, Jans (bib0005) 2015; 27
Roy, Wolsey (bib0041) 1986; 14
Fisher (bib0021) 1985; 15
Florian, Lenstra, Kan (bib0022) 1980; 26
Geoffrion (bib0024) 1974; 2
Sahling, Buschkühl, Tempelmeier, Helber (bib0042) 2009; 36
Fragkos, Degraeve, Reyck (bib0023) 2016; 28
Velázquez-Martínez, Fransoo, Blanco, Mora-Vargas (bib0052) 2014; 26
Wagner, Whitin (bib0053) 1958; 5
Chen (bib0011) 2015; 56
Pimentel, Alvelos, Carvalho (bib0038) 2010; 25
Manne (bib0036) 1958; 4
Fiorotto, de Araujo (bib0016) 2014; 217
Chen, Benjaafar, Elomri (bib0012) 2013; 41
Hua, Cheng, Wang (bib0030) 2011; 132
Absi, Dauzere-Peres, Kedad-Sidhoum, Penz, Rapine (bib0001) 2013; 227
Jans, Degraeve (bib0031) 2004; 32
Sürie, Stadtler (bib0046) 2003; 49
Roy (10.1016/j.cor.2018.05.024_bib0041) 1986; 14
Fiorotto (10.1016/j.cor.2018.05.024_bib0017) 2015; 63
Tempelmeier (10.1016/j.cor.2018.05.024_bib0098) 1996; 42
Toledo (10.1016/j.cor.2018.05.024_bib0048) 2015; 21
Liang (10.1016/j.cor.2018.05.024_bib0034) 2015; 170
Toptal (10.1016/j.cor.2018.05.024_bib0050) 2014; 52
Belvaux (10.1016/j.cor.2018.05.024_bib0006) 2000; 46
Chen (10.1016/j.cor.2018.05.024_bib0011) 2015; 56
Lang (10.1016/j.cor.2018.05.024_bib0033) 2011; 214
Fisher (10.1016/j.cor.2018.05.024_bib0020) 1981; 27
Brahimi (10.1016/j.cor.2018.05.024_bib0009) 2017; 263
Bouchery (10.1016/j.cor.2018.05.024_bib0008) 2012; 222
Fisher (10.1016/j.cor.2018.05.024_bib0021) 1985; 15
Degraeve (10.1016/j.cor.2018.05.024_bib0013) 2007; 55
10.1016/j.cor.2018.05.024_bib0039
Wagner (10.1016/j.cor.2018.05.024_bib0053) 1958; 5
Wu (10.1016/j.cor.2018.05.024_bib0057) 2018; 30
Peters (10.1016/j.cor.2018.05.024_bib0037) 2012; 2
He (10.1016/j.cor.2018.05.024_bib0026) 2012; 226
Geoffrion (10.1016/j.cor.2018.05.024_bib0024) 1974; 2
Manne (10.1016/j.cor.2018.05.024_bib0036) 1958; 4
Wu (10.1016/j.cor.2018.05.024_bib0059) 2012; 196
Absi (10.1016/j.cor.2018.05.024_bib0001) 2013; 227
Akartunalı (10.1016/j.cor.2018.05.024_bib0003) 2016; 28
Buschkühl (10.1016/j.cor.2018.05.024_bib0010) 2010; 32
Protocol (10.1016/j.cor.2018.05.024_bib0062) 1997; 19
Sürie (10.1016/j.cor.2018.05.024_bib0046) 2003; 49
He (10.1016/j.cor.2018.05.024_bib0025) 2015; 87
Florian (10.1016/j.cor.2018.05.024_bib0022) 1980; 26
Trigeiro (10.1016/j.cor.2018.05.024_bib0051) 1989; 35
Hua (10.1016/j.cor.2018.05.024_bib0030) 2011; 132
Yu (10.1016/j.cor.2018.05.024_bib0061) 2013
de Araujo (10.1016/j.cor.2018.05.024_bib0005) 2015; 27
Chen (10.1016/j.cor.2018.05.024_bib0012) 2013; 41
Fragkos (10.1016/j.cor.2018.05.024_bib0023) 2016; 28
Akbalik (10.1016/j.cor.2018.05.024_bib0004) 2014
Wu (10.1016/j.cor.2018.05.024_bib0058) 2011; 214
Wolsey (10.1016/j.cor.2018.05.024_bib0055) 1998
Helmrich (10.1016/j.cor.2018.05.024_bib0029) 2015; 24
Konur (10.1016/j.cor.2018.05.024_bib0032) 2014; 68
Lübbecke (10.1016/j.cor.2018.05.024_bib0035) 2005; 53
Wu (10.1016/j.cor.2018.05.024_bib0056) 2017; 29
Fischetti (10.1016/j.cor.2018.05.024_bib0018) 2005; 104
Sahling (10.1016/j.cor.2018.05.024_bib0042) 2009; 36
Helber (10.1016/j.cor.2018.05.024_bib0028) 2010; 123
Velázquez-Martínez (10.1016/j.cor.2018.05.024_bib0052) 2014; 26
Wu (10.1016/j.cor.2018.05.024_bib0060) 2013; 40
Fiorotto (10.1016/j.cor.2018.05.024_bib0016) 2014; 217
Fischetti (10.1016/j.cor.2018.05.024_bib0019) 2003; 98
Jans (10.1016/j.cor.2018.05.024_bib0031) 2004; 32
Heck (10.1016/j.cor.2018.05.024_bib0027) 2010; 1
Spiller (10.1016/j.cor.2018.05.024_bib0044) 2015; 27
Benjaafar (10.1016/j.cor.2018.05.024_bib0007) 2013; 10
Fahle (10.1016/j.cor.2018.05.024_bib0015) 2001; vol. 2239
Roshani (10.1016/j.cor.2018.05.024_bib0040) 2017; 50
Savelsbergh (10.1016/j.cor.2018.05.024_bib0043) 1994; 6
Stadtler (10.1016/j.cor.2018.05.024_bib0045) 2003; 51
Toledo (10.1016/j.cor.2018.05.024_bib0049) 2006; 175
Absi (10.1016/j.cor.2018.05.024_bib0002) 2016; 248
Pimentel (10.1016/j.cor.2018.05.024_bib0038) 2010; 25
Dzielinski (10.1016/j.cor.2018.05.024_bib0014) 1965; 11
References_xml – volume: 46
  start-page: 724
  year: 2000
  end-page: 738
  ident: bib0006
  article-title: : a specialized branch-and-cut system for lot-sizing problems
  publication-title: Manage. Sci.
– volume: 49
  start-page: 1039
  year: 2003
  end-page: 1054
  ident: bib0046
  article-title: The capacitated lot-sizing problem with linked lot sizes
  publication-title: Manage. Sci.
– volume: 170
  start-page: 88
  year: 2015
  end-page: 96
  ident: bib0034
  article-title: An informative column generation and decomposition method for a production planning and facility location problem
  publication-title: Int. J. Prod. Econ.
– volume: 55
  start-page: 909
  year: 2007
  end-page: 920
  ident: bib0013
  article-title: A new
  publication-title: Oper. Res.
– volume: 217
  start-page: 213
  year: 2014
  end-page: 231
  ident: bib0016
  article-title: Reformulation and a
  publication-title: Ann. Oper. Res.
– volume: 53
  start-page: 1007
  year: 2005
  end-page: 1023
  ident: bib0035
  article-title: Selected topics in column generation
  publication-title: Oper. Res.
– volume: 42
  start-page: 738
  year: 1996
  end-page: 757
  ident: bib0098
  article-title: A
  publication-title: Manage. Sci.
– volume: 222
  start-page: 229
  year: 2012
  end-page: 240
  ident: bib0008
  article-title: Including sustainability criteria into inventory models
  publication-title: Eur. J. Oper. Res.
– volume: 30
  start-page: 236
  year: 2018
  end-page: 258
  ident: bib0057
  article-title: Analytics branching and selection for the capacitated multi-item lot sizing problem with non-identical machines
  publication-title: Inf. J. Comput.
– volume: 214
  start-page: 595
  year: 2011
  end-page: 605
  ident: bib0033
  article-title: Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
  publication-title: Eur. J. Oper. Res.
– volume: 50
  start-page: 9008
  year: 2017
  end-page: 9013
  ident: bib0040
  article-title: A relax-and-fix heuristic approach for the capacitated dynamic lot sizing problem in integrated manufacturing/remanufacturing systems
  publication-title: IFAC-PapersOnLine
– volume: 248
  start-page: 849
  year: 2016
  end-page: 855
  ident: bib0002
  article-title: The single-item green lot-sizing problem with fixed carbon emissions
  publication-title: Eur. J. Oper. Res.
– volume: 2
  year: 1974
  ident: bib0024
  article-title: Lagrangean relaxation for integer programming
  publication-title: Approaches to Integer Programming. Mathematical Programming Studies
– volume: 26
  start-page: 669
  year: 1980
  end-page: 679
  ident: bib0022
  article-title: Deterministic production planning: algorithms and complexity
  publication-title: Manage. Sci.
– volume: 19
  year: 1997
  ident: bib0062
  article-title: United Nations framework convention on climate change
  publication-title: Kyoto Protocol, Kyoto
– volume: 15
  start-page: 10
  year: 1985
  end-page: 21
  ident: bib0021
  article-title: An applications oriented guide to lagrangian relaxation
  publication-title: Interfaces
– volume: 1
  start-page: 34
  year: 2010
  end-page: 39
  ident: bib0027
  article-title: Lot-size planning with non-linear cost functions supporting environmental sustainability
  publication-title: Int. J. Green Comput.
– volume: 104
  start-page: 91
  year: 2005
  end-page: 104
  ident: bib0018
  article-title: The feasibility pump
  publication-title: Math. Program.
– volume: 175
  start-page: 1070
  year: 2006
  end-page: 1083
  ident: bib0049
  article-title: A lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
  publication-title: Eur. J. Oper. Res.
– volume: 68
  start-page: 14
  year: 2014
  end-page: 38
  ident: bib0032
  article-title: Integrated inventory control and transportation decisions under carbon emissions regulations:
  publication-title: Transp. Res. Part E
– volume: 52
  start-page: 243
  year: 2014
  end-page: 269
  ident: bib0050
  article-title: Joint decisions on inventory replenishment and emission reduction investment under different emission regulations
  publication-title: Int. J. Prod. Res.
– volume: 27
  start-page: 431
  year: 2015
  end-page: 448
  ident: bib0005
  article-title: Period decompositions for the capacitated lot sizing problem with setup times
  publication-title: Inf. J. Comput.
– year: 1998
  ident: bib0055
  article-title: Integer Programming
– volume: 29
  start-page: 523
  year: 2017
  end-page: 543
  ident: bib0056
  article-title: Progressive selection method for the coupled lot-sizing and cutting-stock problem
  publication-title: Inf. J. Comput.
– volume: 35
  start-page: 353
  year: 1989
  end-page: 366
  ident: bib0051
  article-title: Capacitated lot sizing with setup times
  publication-title: Manage. Sci.
– volume: 51
  start-page: 487
  year: 2003
  end-page: 502
  ident: bib0045
  article-title: Multilevel lot sizing with setup times and multiple constrained resources: internally rolling schedules with lot-sizing windows
  publication-title: Oper. Res.
– volume: 32
  start-page: 231
  year: 2010
  end-page: 261
  ident: bib0010
  article-title: Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
  publication-title: OR Spectr.
– start-page: 30
  year: 2014
  end-page: 35
  ident: bib0004
  article-title: Single-item lot sizing problem with carbon emission under the cap-and-trade policy
  publication-title: Control, Decision and Information Technologies (CoDIT), 2014 International Conference on
– volume: 28
  start-page: 465
  year: 2016
  end-page: 482
  ident: bib0023
  article-title: A horizon decomposition approach for the capacitated lot-sizing problem with setup times
  publication-title: Inf. J. Comput.
– volume: 98
  start-page: 23
  year: 2003
  end-page: 47
  ident: bib0019
  article-title: Local branching
  publication-title: Math. Program. Ser. B
– volume: 87
  start-page: 245
  year: 2015
  end-page: 254
  ident: bib0025
  article-title: An energy-responsive optimization method for machine tool selection and operation sequence in flexible machining job shops
  publication-title: J. Cleaner Prod.
– volume: 132
  start-page: 178
  year: 2011
  end-page: 185
  ident: bib0030
  article-title: Managing carbon footprints in inventory management
  publication-title: Int. J. Prod. Econ.
– volume: 214
  start-page: 428
  year: 2011
  end-page: 441
  ident: bib0058
  article-title: An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
  publication-title: Eur. J. Oper. Res.
– volume: 40
  start-page: 1852
  year: 2013
  end-page: 1863
  ident: bib0060
  article-title: A
  publication-title: Comput. Oper. Res.
– volume: vol. 2239
  start-page: 93
  year: 2001
  end-page: 107
  ident: bib0015
  article-title: Symmetry Breaking
  publication-title: Principles and Practice of Constraint Programming – CP 2001
– volume: 36
  start-page: 2546
  year: 2009
  end-page: 2553
  ident: bib0042
  article-title: Solving a multilevel capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
  publication-title: Comput. Oper. Res.
– volume: 63
  start-page: 136
  year: 2015
  end-page: 148
  ident: bib0017
  article-title: Hybrid methods for lot sizing on parallel machines
  publication-title: Comput. Oper. Res.
– start-page: 413
  year: 2013
  end-page: 417
  ident: bib0061
  article-title: A dynamic lot sizing model with carbon emission constraint and multi-mode production: a general property and a polynomially solvable case
  publication-title: Networking, Sensing and Control (ICNSC), 2013 10th IEEE International Conference on
– volume: 10
  start-page: 99
  year: 2013
  end-page: 116
  ident: bib0007
  article-title: Carbon footprint and the management of supply chains: insights from simple models
  publication-title: Autom. Sci. Eng. IEEE Trans.
– volume: 6
  start-page: 445
  year: 1994
  end-page: 454
  ident: bib0043
  article-title: Preprocessing and probing techniques for mixed integer programming problems
  publication-title: ORSA J. Comput.
– volume: 14
  start-page: 199
  year: 1986
  end-page: 213
  ident: bib0041
  article-title: Valid inequalities for mixed 0–1 programs
  publication-title: Discrete Appl. Math.
– volume: 11
  start-page: 874
  year: 1965
  end-page: 890
  ident: bib0014
  article-title: Optimal programming of lot sizes, inventory and labor allocations
  publication-title: Manage. Sci.
– volume: 27
  start-page: 1
  year: 1981
  end-page: 18
  ident: bib0020
  article-title: The lagrangian relaxation method for solving integer programming problems
  publication-title: Manage. Sci.
– volume: 24
  start-page: 50
  year: 2015
  end-page: 62
  ident: bib0029
  article-title: The economic lot-sizing problem with an emission capacity constraint
  publication-title: Eur. J. Oper. Res.
– volume: 4
  start-page: 115
  year: 1958
  end-page: 135
  ident: bib0036
  article-title: Programming of economic lot sizes
  publication-title: Manage. Sci.
– volume: 226
  start-page: 255
  year: 2012
  end-page: 266
  ident: bib0026
  article-title: Analysis and estimation of energy consumption for numerical control machining
  publication-title: Proc. Inst. Mech.Eng. Part B
– volume: 227
  start-page: 55
  year: 2013
  end-page: 61
  ident: bib0001
  article-title: Lot sizing with carbon emission constraints
  publication-title: Eur. J. Oper. Res.
– volume: 56
  start-page: 25
  year: 2015
  end-page: 36
  ident: bib0011
  article-title: Fix-and-optimize and variable neighborhood search approaches for multi-level capacitated lot sizing problems
  publication-title: Omega
– volume: 28
  start-page: 766
  year: 2016
  end-page: 780
  ident: bib0003
  article-title: Local cuts and two-period convex hull closures for big-bucket lot-sizing problems
  publication-title: Inf. J. Comput.
– volume: 21
  start-page: 687
  year: 2015
  end-page: 717
  ident: bib0048
  article-title: A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
  publication-title: J. Heuristic
– volume: 263
  start-page: 838
  year: 2017
  end-page: 863
  ident: bib0009
  article-title: Single-item dynamic lot-sizing problems:
  publication-title: Eur. J. Oper. Res.
– reference: Pochet, Y., Wolsey, L.A., eds. 2006. Production planning by mixed integer programming. Springer.
– volume: 123
  start-page: 247
  year: 2010
  end-page: 256
  ident: bib0028
  article-title: A fix-and-optimize approach for the multi-level capacitated lot sizing problem
  publication-title: Int. J. Prod. Econ.
– volume: 25
  start-page: 299
  year: 2010
  end-page: 319
  ident: bib0038
  article-title: Comparing
  publication-title: Optim. Methods Softw.
– volume: 5
  start-page: 89
  year: 1958
  end-page: 96
  ident: bib0053
  article-title: Dynamic version of the economic lot size model
  publication-title: Manage. Sci.
– volume: 41
  start-page: 172
  year: 2013
  end-page: 179
  ident: bib0012
  article-title: The carbon-constrained
  publication-title: Oper. Res. Lett.
– volume: 32
  start-page: 185
  year: 2004
  end-page: 195
  ident: bib0031
  article-title: Improved lower bounds for the capacitated lot sizing problem with setup times
  publication-title: Oper. Res. Lett.
– volume: 196
  start-page: 635
  year: 2012
  end-page: 650
  ident: bib0059
  article-title: An
  publication-title: Ann. Oper. Res.
– volume: 27
  year: 2015
  ident: bib0044
  article-title: All electricity is not priced equally: time-variant pricing 101
  publication-title: Environ. Defense Fund
– volume: 26
  start-page: 196
  year: 2014
  end-page: 220
  ident: bib0052
  article-title: The impact of carbon footprinting aggregation on realizing emission reduction targets
  publication-title: Flexible Serv. Manuf. J.
– volume: 2
  start-page: 2
  year: 2012
  end-page: 4
  ident: bib0037
  article-title: Rapid growth in
  publication-title: Nat. Clim. Change
– volume: 196
  start-page: 635
  issue: 1
  year: 2012
  ident: 10.1016/j.cor.2018.05.024_bib0059
  article-title: An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times
  publication-title: Ann. Oper. Res.
  doi: 10.1007/s10479-011-1026-9
– volume: 68
  start-page: 14
  year: 2014
  ident: 10.1016/j.cor.2018.05.024_bib0032
  article-title: Integrated inventory control and transportation decisions under carbon emissions regulations: LTL vs. TLcarriers
  publication-title: Transp. Res. Part E
  doi: 10.1016/j.tre.2014.04.012
– volume: 15
  start-page: 10
  issue: 2
  year: 1985
  ident: 10.1016/j.cor.2018.05.024_bib0021
  article-title: An applications oriented guide to lagrangian relaxation
  publication-title: Interfaces
  doi: 10.1287/inte.15.2.10
– volume: 227
  start-page: 55
  issue: 1
  year: 2013
  ident: 10.1016/j.cor.2018.05.024_bib0001
  article-title: Lot sizing with carbon emission constraints
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2012.11.044
– volume: 10
  start-page: 99
  issue: 1
  year: 2013
  ident: 10.1016/j.cor.2018.05.024_bib0007
  article-title: Carbon footprint and the management of supply chains: insights from simple models
  publication-title: Autom. Sci. Eng. IEEE Trans.
  doi: 10.1109/TASE.2012.2203304
– volume: 222
  start-page: 229
  issue: 2
  year: 2012
  ident: 10.1016/j.cor.2018.05.024_bib0008
  article-title: Including sustainability criteria into inventory models
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2012.05.004
– volume: 50
  start-page: 9008
  issue: 1
  year: 2017
  ident: 10.1016/j.cor.2018.05.024_bib0040
  article-title: A relax-and-fix heuristic approach for the capacitated dynamic lot sizing problem in integrated manufacturing/remanufacturing systems
  publication-title: IFAC-PapersOnLine
  doi: 10.1016/j.ifacol.2017.08.1580
– volume: 2
  start-page: 2
  issue: 1
  year: 2012
  ident: 10.1016/j.cor.2018.05.024_bib0037
  article-title: Rapid growth in CO2 emissions after the 2008–2009 global financial crisis
  publication-title: Nat. Clim. Change
  doi: 10.1038/nclimate1332
– volume: 104
  start-page: 91
  issue: 1
  year: 2005
  ident: 10.1016/j.cor.2018.05.024_bib0018
  article-title: The feasibility pump
  publication-title: Math. Program.
  doi: 10.1007/s10107-004-0570-3
– volume: 27
  start-page: 431
  issue: 3
  year: 2015
  ident: 10.1016/j.cor.2018.05.024_bib0005
  article-title: Period decompositions for the capacitated lot sizing problem with setup times
  publication-title: Inf. J. Comput.
  doi: 10.1287/ijoc.2014.0636
– volume: 56
  start-page: 25
  year: 2015
  ident: 10.1016/j.cor.2018.05.024_bib0011
  article-title: Fix-and-optimize and variable neighborhood search approaches for multi-level capacitated lot sizing problems
  publication-title: Omega
  doi: 10.1016/j.omega.2015.03.002
– volume: 26
  start-page: 669
  issue: 7
  year: 1980
  ident: 10.1016/j.cor.2018.05.024_bib0022
  article-title: Deterministic production planning: algorithms and complexity
  publication-title: Manage. Sci.
  doi: 10.1287/mnsc.26.7.669
– volume: 14
  start-page: 199
  year: 1986
  ident: 10.1016/j.cor.2018.05.024_bib0041
  article-title: Valid inequalities for mixed 0–1 programs
  publication-title: Discrete Appl. Math.
  doi: 10.1016/0166-218X(86)90061-2
– volume: 40
  start-page: 1852
  issue: 7
  year: 2013
  ident: 10.1016/j.cor.2018.05.024_bib0060
  article-title: A lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2013.01.021
– volume: 170
  start-page: 88
  issue: A
  year: 2015
  ident: 10.1016/j.cor.2018.05.024_bib0034
  article-title: An informative column generation and decomposition method for a production planning and facility location problem
  publication-title: Int. J. Prod. Econ.
  doi: 10.1016/j.ijpe.2015.08.024
– volume: 36
  start-page: 2546
  issue: 9
  year: 2009
  ident: 10.1016/j.cor.2018.05.024_bib0042
  article-title: Solving a multilevel capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2008.10.009
– ident: 10.1016/j.cor.2018.05.024_bib0039
– volume: 27
  issue: 1
  year: 2015
  ident: 10.1016/j.cor.2018.05.024_bib0044
  article-title: All electricity is not priced equally: time-variant pricing 101
  publication-title: Environ. Defense Fund
– volume: 28
  start-page: 465
  issue: 3
  year: 2016
  ident: 10.1016/j.cor.2018.05.024_bib0023
  article-title: A horizon decomposition approach for the capacitated lot-sizing problem with setup times
  publication-title: Inf. J. Comput.
  doi: 10.1287/ijoc.2016.0691
– volume: 98
  start-page: 23
  year: 2003
  ident: 10.1016/j.cor.2018.05.024_bib0019
  article-title: Local branching
  publication-title: Math. Program. Ser. B
  doi: 10.1007/s10107-003-0395-5
– volume: 5
  start-page: 89
  issue: 1
  year: 1958
  ident: 10.1016/j.cor.2018.05.024_bib0053
  article-title: Dynamic version of the economic lot size model
  publication-title: Manage. Sci.
  doi: 10.1287/mnsc.5.1.89
– volume: 46
  start-page: 724
  issue: 5
  year: 2000
  ident: 10.1016/j.cor.2018.05.024_bib0006
  article-title: BC-PROD: a specialized branch-and-cut system for lot-sizing problems
  publication-title: Manage. Sci.
  doi: 10.1287/mnsc.46.5.724.12048
– volume: 53
  start-page: 1007
  issue: 6
  year: 2005
  ident: 10.1016/j.cor.2018.05.024_bib0035
  article-title: Selected topics in column generation
  publication-title: Oper. Res.
  doi: 10.1287/opre.1050.0234
– volume: 175
  start-page: 1070
  issue: 2
  year: 2006
  ident: 10.1016/j.cor.2018.05.024_bib0049
  article-title: A lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2005.06.029
– volume: 6
  start-page: 445
  issue: 4
  year: 1994
  ident: 10.1016/j.cor.2018.05.024_bib0043
  article-title: Preprocessing and probing techniques for mixed integer programming problems
  publication-title: ORSA J. Comput.
  doi: 10.1287/ijoc.6.4.445
– volume: 32
  start-page: 231
  issue: 2
  year: 2010
  ident: 10.1016/j.cor.2018.05.024_bib0010
  article-title: Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
  publication-title: OR Spectr.
  doi: 10.1007/s00291-008-0150-7
– volume: 35
  start-page: 353
  issue: 3
  year: 1989
  ident: 10.1016/j.cor.2018.05.024_bib0051
  article-title: Capacitated lot sizing with setup times
  publication-title: Manage. Sci.
  doi: 10.1287/mnsc.35.3.353
– volume: 41
  start-page: 172
  issue: 2
  year: 2013
  ident: 10.1016/j.cor.2018.05.024_bib0012
  article-title: The carbon-constrained EOQ
  publication-title: Oper. Res. Lett.
  doi: 10.1016/j.orl.2012.12.003
– volume: 87
  start-page: 245
  issue: 1
  year: 2015
  ident: 10.1016/j.cor.2018.05.024_bib0025
  article-title: An energy-responsive optimization method for machine tool selection and operation sequence in flexible machining job shops
  publication-title: J. Cleaner Prod.
  doi: 10.1016/j.jclepro.2014.10.006
– volume: 19
  year: 1997
  ident: 10.1016/j.cor.2018.05.024_bib0062
  article-title: United Nations framework convention on climate change
  publication-title: Kyoto Protocol, Kyoto
– volume: 11
  start-page: 874
  issue: 9
  year: 1965
  ident: 10.1016/j.cor.2018.05.024_bib0014
  article-title: Optimal programming of lot sizes, inventory and labor allocations
  publication-title: Manage. Sci.
  doi: 10.1287/mnsc.11.9.874
– volume: 42
  start-page: 738
  issue: 5
  year: 1996
  ident: 10.1016/j.cor.2018.05.024_bib0098
  article-title: A lagrangian-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times
  publication-title: Manage. Sci.
  doi: 10.1287/mnsc.42.5.738
– volume: 214
  start-page: 428
  issue: 2
  year: 2011
  ident: 10.1016/j.cor.2018.05.024_bib0058
  article-title: An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2011.04.029
– volume: 217
  start-page: 213
  issue: 1
  year: 2014
  ident: 10.1016/j.cor.2018.05.024_bib0016
  article-title: Reformulation and a lagrangian heuristic for lot sizing problem on parallel machines
  publication-title: Ann. Oper. Res.
– volume: 51
  start-page: 487
  issue: 3
  year: 2003
  ident: 10.1016/j.cor.2018.05.024_bib0045
  article-title: Multilevel lot sizing with setup times and multiple constrained resources: internally rolling schedules with lot-sizing windows
  publication-title: Oper. Res.
  doi: 10.1287/opre.51.3.487.14949
– volume: 248
  start-page: 849
  issue: 3
  year: 2016
  ident: 10.1016/j.cor.2018.05.024_bib0002
  article-title: The single-item green lot-sizing problem with fixed carbon emissions
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2015.07.052
– start-page: 30
  year: 2014
  ident: 10.1016/j.cor.2018.05.024_bib0004
  article-title: Single-item lot sizing problem with carbon emission under the cap-and-trade policy
– volume: 55
  start-page: 909
  issue: 5
  year: 2007
  ident: 10.1016/j.cor.2018.05.024_bib0013
  article-title: A new Dantzig–Wolfe reformulation and branch-and-price algorithm for the capacitated lot-sizing problem with setup times
  publication-title: Oper. Res.
  doi: 10.1287/opre.1070.0404
– volume: 21
  start-page: 687
  issue: 5
  year: 2015
  ident: 10.1016/j.cor.2018.05.024_bib0048
  article-title: A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
  publication-title: J. Heuristic
  doi: 10.1007/s10732-015-9295-0
– volume: 226
  start-page: 255
  issue: 2
  year: 2012
  ident: 10.1016/j.cor.2018.05.024_bib0026
  article-title: Analysis and estimation of energy consumption for numerical control machining
  publication-title: Proc. Inst. Mech.Eng. Part B
  doi: 10.1177/0954405411417673
– volume: 4
  start-page: 115
  issue: 2
  year: 1958
  ident: 10.1016/j.cor.2018.05.024_bib0036
  article-title: Programming of economic lot sizes
  publication-title: Manage. Sci.
  doi: 10.1287/mnsc.4.2.115
– volume: 49
  start-page: 1039
  issue: 8
  year: 2003
  ident: 10.1016/j.cor.2018.05.024_bib0046
  article-title: The capacitated lot-sizing problem with linked lot sizes
  publication-title: Manage. Sci.
  doi: 10.1287/mnsc.49.8.1039.16406
– volume: 26
  start-page: 196
  issue: 1
  year: 2014
  ident: 10.1016/j.cor.2018.05.024_bib0052
  article-title: The impact of carbon footprinting aggregation on realizing emission reduction targets
  publication-title: Flexible Serv. Manuf. J.
  doi: 10.1007/s10696-012-9170-3
– volume: 30
  start-page: 236
  issue: 2
  year: 2018
  ident: 10.1016/j.cor.2018.05.024_bib0057
  article-title: Analytics branching and selection for the capacitated multi-item lot sizing problem with non-identical machines
  publication-title: Inf. J. Comput.
  doi: 10.1287/ijoc.2017.0777
– volume: 28
  start-page: 766
  issue: 4
  year: 2016
  ident: 10.1016/j.cor.2018.05.024_bib0003
  article-title: Local cuts and two-period convex hull closures for big-bucket lot-sizing problems
  publication-title: Inf. J. Comput.
  doi: 10.1287/ijoc.2016.0712
– volume: 123
  start-page: 247
  issue: 2
  year: 2010
  ident: 10.1016/j.cor.2018.05.024_bib0028
  article-title: A fix-and-optimize approach for the multi-level capacitated lot sizing problem
  publication-title: Int. J. Prod. Econ.
  doi: 10.1016/j.ijpe.2009.08.022
– year: 1998
  ident: 10.1016/j.cor.2018.05.024_bib0055
– volume: 24
  start-page: 50
  issue: 1
  year: 2015
  ident: 10.1016/j.cor.2018.05.024_bib0029
  article-title: The economic lot-sizing problem with an emission capacity constraint
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2014.06.030
– volume: 2
  year: 1974
  ident: 10.1016/j.cor.2018.05.024_bib0024
  article-title: Lagrangean relaxation for integer programming
– volume: 32
  start-page: 185
  issue: 2
  year: 2004
  ident: 10.1016/j.cor.2018.05.024_bib0031
  article-title: Improved lower bounds for the capacitated lot sizing problem with setup times
  publication-title: Oper. Res. Lett.
  doi: 10.1016/j.orl.2003.06.001
– volume: 29
  start-page: 523
  issue: 3
  year: 2017
  ident: 10.1016/j.cor.2018.05.024_bib0056
  article-title: Progressive selection method for the coupled lot-sizing and cutting-stock problem
  publication-title: Inf. J. Comput.
  doi: 10.1287/ijoc.2017.0746
– volume: 214
  start-page: 595
  issue: 3
  year: 2011
  ident: 10.1016/j.cor.2018.05.024_bib0033
  article-title: Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2011.05.014
– volume: 263
  start-page: 838
  issue: 3
  year: 2017
  ident: 10.1016/j.cor.2018.05.024_bib0009
  article-title: Single-item dynamic lot-sizing problems: an updated survey
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2017.05.008
– volume: vol. 2239
  start-page: 93
  year: 2001
  ident: 10.1016/j.cor.2018.05.024_bib0015
  article-title: Symmetry Breaking
– volume: 25
  start-page: 299
  issue: 2
  year: 2010
  ident: 10.1016/j.cor.2018.05.024_bib0038
  article-title: Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
  publication-title: Optim. Methods Softw.
  doi: 10.1080/10556780902992837
– start-page: 413
  year: 2013
  ident: 10.1016/j.cor.2018.05.024_bib0061
  article-title: A dynamic lot sizing model with carbon emission constraint and multi-mode production: a general property and a polynomially solvable case
– volume: 27
  start-page: 1
  issue: 1
  year: 1981
  ident: 10.1016/j.cor.2018.05.024_bib0020
  article-title: The lagrangian relaxation method for solving integer programming problems
  publication-title: Manage. Sci.
  doi: 10.1287/mnsc.27.1.1
– volume: 63
  start-page: 136
  issue: 2
  year: 2015
  ident: 10.1016/j.cor.2018.05.024_bib0017
  article-title: Hybrid methods for lot sizing on parallel machines
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2015.04.015
– volume: 52
  start-page: 243
  issue: 1
  year: 2014
  ident: 10.1016/j.cor.2018.05.024_bib0050
  article-title: Joint decisions on inventory replenishment and emission reduction investment under different emission regulations
  publication-title: Int. J. Prod. Res.
  doi: 10.1080/00207543.2013.836615
– volume: 1
  start-page: 34
  issue: 1
  year: 2010
  ident: 10.1016/j.cor.2018.05.024_bib0027
  article-title: Lot-size planning with non-linear cost functions supporting environmental sustainability
  publication-title: Int. J. Green Comput.
  doi: 10.4018/jgc.2010010104
– volume: 132
  start-page: 178
  issue: 2
  year: 2011
  ident: 10.1016/j.cor.2018.05.024_bib0030
  article-title: Managing carbon footprints in inventory management
  publication-title: Int. J. Prod. Econ.
  doi: 10.1016/j.ijpe.2011.03.024
SSID ssj0000721
Score 2.3734496
Snippet •We propose a mixed integer programming model for the green capacitated multi-item lot sizing problem with parallel machines.•The mathematical model can...
Carbon emissions related to energy consumptions from the manufacturing industry have become a substantial part of environmental burdens. To reduce carbon...
SourceID proquest
crossref
elsevier
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 149
SubjectTerms Carbon
Carbon emissions
Column generation
Computation
Customer satisfaction
Emissions control
Energy consumptions
Green manufacturing
Heuristic
Integer programming
Lagrangian relaxation
Linear programming
Lot sizing
Lower bounds
Manufacturing
Mixed integer
Operations research
Parallel processing
Problem solving
Production planning
Studies
Title The green capacitated multi-item lot sizing problem with parallel machines
URI https://dx.doi.org/10.1016/j.cor.2018.05.024
https://www.proquest.com/docview/2111554062
Volume 98
WOSCitedRecordID wos000440526800012&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: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1873-765X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000721
  issn: 0305-0548
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Nb9QwELWgRYgeCiwg-gHygROrSLETx86xqlpBDxWHIvZmOY6DtgrJarOtqv56xl_ZsqgVPaCVopWVWNl9L57JeOYNQp94zUTTaJJQoVWSlw1NFBcsqauKwMcUeZO6ZhP8_FzMZuW3ENAfXDsB3nXi5qZc_FeoYQzAtqWzj4B7nBQG4DuADkeAHY7_DPxPm00z1WAIta0hA6fSJQ4mNlI7bfvVdJjf-jJ0107GR2OtCnjbmnb6yyVYhuTCqGIQuj8Mjiv9wixDDl1QCxqjyj-uHAVUHwdmc-XCsadrHo5R6mPVLftgO11A1lmEcGKIRRAxZrWNNVg2FZB57cy4vvou02GBJF6gNNha4hXM_1rGfUThElCwkq1EOHFVX2v9p2T2hikbEwxj7tqlhCmknUKmTMIUT9E25ayEJXz76OvJ7Gxttbmr0Rt_QdwBd7mAG_dxnw-zYc2di3LxCu2Gdwt85DnxGj0x3QQ9j6UNE_QygojDij5BO3f0KN-gM-AOdtzBd7iD19zBwB3suYMDd7DlDo7cwZE7b9H305OL4y9JaLaR6IzxVZKbsqm13QQvmeHgJNIi002T6bSihpam4JpQ1ZjC2J1vQ4hm4F-VqckMFWlusndoq-s78x7hqq6UKSq4Et4tiKoVzyqaK5ZVRSFqmu2hNP59UgcletsQpZX3wraHPo-XLLwMy0Mn5xETGfxI7x9K4NdDlx1G_GR4ngdJwRcAjzst6P5jbuEAvVg_H4doa7W8Mh_QM329mg_Lj4F7vwHeHJ13
linkProvider Elsevier
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=The+green+capacitated+multi-item+lot+sizing+problem+with+parallel+machines&rft.jtitle=Computers+%26+operations+research&rft.au=Wu%2C+Tao&rft.au=Xiao%2C+Fan&rft.au=Zhang%2C+Canrong&rft.au=He%2C+Yan&rft.date=2018-10-01&rft.issn=0305-0548&rft.volume=98&rft.spage=149&rft.epage=164&rft_id=info:doi/10.1016%2Fj.cor.2018.05.024&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_cor_2018_05_024
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon