Energy-aware lot sizing problem: Complexity analysis and exact algorithms

The single-item lot sizing problem under a periodic energy limitation is considered in this paper. Identical and parallel capacitated machines constitute the production system, each one consuming a certain amount of energy when being switched on, when reserved, and when producing. We consider a cost...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:International journal of production economics Ročník 203; s. 254 - 263
Hlavní autori: Rapine, Christophe, Goisque, Guillaume, Akbalik, Ayse
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 01.09.2018
Elsevier [1991-....]
Predmet:
ISSN:0925-5273, 1873-7579
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract The single-item lot sizing problem under a periodic energy limitation is considered in this paper. Identical and parallel capacitated machines constitute the production system, each one consuming a certain amount of energy when being switched on, when reserved, and when producing. We consider a cost for starting-up the machines, a reservation cost to keep the machines ready for production, in addition to classical lot sizing costs, such as, joint setup cost, unit production cost and unit holding cost, all being time-dependent. Besides the classical lot sizing decisions of how much and in which periods to produce, we have to decide the number of machines to switch on and to switch off in each period. We show that this problem is NP-hard even under restricted conditions. In contrast, assuming stationary energy parameters, we propose two polynomial time dynamic programming algorithms to solve the problem to optimality. The first algorithm is proposed for the case with null setup cost, null reservation cost and null reservation energy consumption, and runs in O(M5T4) time, with M being the number of machines and T the number of periods. We show that we can extend this algorithm to solve the generalized version of the problem in time complexity O(M6T6). •The single-item lot sizing problem with a limited energy consumption is considered.•The production system is constituted of identical, parallel capacitated machines.•Energy is consumed by machine start-ups, machine reservations and production.•We establish the NP-hardness of the problem.•We develop polynomial time algorithms for stationary energy parameters.
AbstractList The single-item lot sizing problem under a periodic energy limitation is considered in this paper. Identical and parallel capacitated machines constitute the production system, each one consuming a certain amount of energy when being switched on, when reserved, and when producing. We consider a cost for starting-up the machines, a reservation cost to keep the machines ready for production, in addition to classical lot sizing costs, such as, joint setup cost, unit production cost and unit holding cost, all being time-dependent. Besides the classical lot sizing decisions of how much and in which periods to produce, we have to decide the number of machines to switch on and to switch off in each period. We show that this problem is NP-hard even under restricted conditions. In contrast, assuming stationary energy parameters, we propose two polynomial time dynamic programming algorithms to solve the problem to optimality. The first algorithm is proposed for the case with null setup cost, null reservation cost and null reservation energy consumption, and runs in O(M5T4) time, with M being the number of machines and T the number of periods. We show that we can extend this algorithm to solve the generalized version of the problem in time complexity O(M6T6). •The single-item lot sizing problem with a limited energy consumption is considered.•The production system is constituted of identical, parallel capacitated machines.•Energy is consumed by machine start-ups, machine reservations and production.•We establish the NP-hardness of the problem.•We develop polynomial time algorithms for stationary energy parameters.
The single-item lot sizing problem under a periodic energy limitation is considered in this paper. Identical and parallel capacitated machines constitute the production system, each one consuming a certain amount of energy when being switched on, when reserved, and when producing. We consider a cost for starting-up the machines, a reservation cost to keep the machines ready for production, in addition to classical lot sizing costs, such as, joint setup cost, unit production cost and unit holding cost, all being time-dependent. Besides the classical lot sizing decisions of how much and in which periods to produce, we have to decide the number of machines to switch on and to switch off in each period. We show that this problem is NP-hard even under restricted conditions. In contrast, assuming stationary energy parameters, we propose two polynomial time dynamic programming algorithms to solve the problem to optimality. The first algorithm is proposed for the case with null setup cost, null reservation cost and null reservation energy consumption, and runs in O(M 5 T 4) time, with M being the number of machines and T the number of periods. We show that we can extend this algorithm to solve the generalized version of the problem in time complexity O(M 6 T 6).
Author Rapine, Christophe
Akbalik, Ayse
Goisque, Guillaume
Author_xml – sequence: 1
  givenname: Christophe
  surname: Rapine
  fullname: Rapine, Christophe
  email: christophe.rapine@univ-lorraine.fr
  organization: LCOMS, Université de Lorraine, Technopole de Metz, France
– sequence: 2
  givenname: Guillaume
  surname: Goisque
  fullname: Goisque, Guillaume
  email: guillaume.goisque@univ-lorraine.fr
  organization: Université de Lorraine, France
– sequence: 3
  givenname: Ayse
  surname: Akbalik
  fullname: Akbalik, Ayse
  email: ayse.akbalik@univ-lorraine.fr
  organization: LCOMS, Université de Lorraine, Technopole de Metz, France
BackLink https://hal.science/hal-01837881$$DView record in HAL
BookMark eNp9kD1vwjAQhq2qlQq0f6BT1g5J_ZHYSdUFIVqQkLqwW8Y5g6MkRrZFob--QbRLB6Y7nd7nTveM0W3vekDoieCMYMJfmsw2e8goJmWGeYYpvkEjUgqWikJUt2iEK1qkBRXsHo1DaDDGgpTlCC3nPfjtKVVfykPSupgE-237bbL3btNC95rMXLdv4WjjKVG9ak_BhqGpEzgqHRPVbp23cdeFB3RnVBvg8bdO0Pp9vp4t0tXnx3I2XaU6z1lMOd2oGjNjOOF1LbimACyHumQ8zznoDTcUM77BRlSGVFopjokxBc3NkAQ2Qc-XtTvVyr23nfIn6ZSVi-lKnmeDAibKkhzIkC0vWe1dCB6M1DaqaF0fvbKtJFie7clGnu3Jsz2JuRzsDSj9h_7dugq9XSAY_j9Y8DJoC72G2nrQUdbOXsN_AIkAjAw
CitedBy_id crossref_primary_10_1007_s10479_023_05338_x
crossref_primary_10_3390_su10113867
crossref_primary_10_1016_j_cie_2021_107456
crossref_primary_10_1080_00207543_2023_2224903
crossref_primary_10_1108_K_06_2019_0389
crossref_primary_10_1016_j_omega_2024_103260
crossref_primary_10_1016_j_ejor_2020_04_043
crossref_primary_10_1080_00207543_2021_1969048
crossref_primary_10_3390_su132313317
Cites_doi 10.1109/TASE.2015.2495328
10.1287/mnsc.18.1.12
10.1016/j.ejor.2017.05.008
10.1080/00207543.2016.1206670
10.1007/s00291-015-0423-x
10.1016/j.cor.2011.09.007
10.1016/j.ejor.2004.01.054
10.1287/mnsc.28.10.1174
10.1016/j.ijpe.2010.09.030
10.1016/j.cie.2017.08.011
10.1016/j.omega.2017.10.004
10.1016/j.jclepro.2015.06.060
10.1016/j.dam.2016.03.001
10.1287/mnsc.5.1.89
10.1016/j.cie.2016.08.021
10.1016/j.apenergy.2012.12.032
10.1287/mnsc.26.7.669
10.1016/j.cie.2012.01.008
10.1287/opre.35.3.389
10.1016/j.jclepro.2016.10.191
10.1016/j.jclepro.2017.01.166
10.1016/j.compchemeng.2016.01.002
10.1007/s10601-015-9192-z
10.1016/j.procir.2015.02.038
10.1016/j.ejor.2015.07.017
10.1016/S0925-5273(98)00076-0
ContentType Journal Article
Copyright 2018 Elsevier B.V.
licence_http://creativecommons.org/publicdomain/zero
Copyright_xml – notice: 2018 Elsevier B.V.
– notice: licence_http://creativecommons.org/publicdomain/zero
DBID AAYXX
CITATION
1XC
VOOES
DOI 10.1016/j.ijpe.2018.06.020
DatabaseName CrossRef
Hyper Article en Ligne (HAL)
Hyper Article en Ligne (HAL) (Open Access)
DatabaseTitle CrossRef
DatabaseTitleList

DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Business
Computer Science
EISSN 1873-7579
EndPage 263
ExternalDocumentID oai:HAL:hal-01837881v1
10_1016_j_ijpe_2018_06_020
S0925527318302640
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1RT
1~.
1~5
29J
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9JN
9JO
AAAKF
AAAKG
AABNK
AACTN
AAEDT
AAEDW
AAFFL
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAPFB
AAQFI
AAQXK
AARIN
AAXUO
ABFNM
ABFRF
ABJNI
ABMAC
ABUCO
ABXDB
ABYKQ
ACDAQ
ACGFO
ACGFS
ACGOD
ACIWK
ACNNM
ACRLP
ACROA
ADBBV
ADEZE
ADFHU
ADMUD
ADTZH
AEBSH
AECPX
AEFWE
AEKER
AENEX
AEYQN
AFKWA
AFODL
AFTJW
AGHFR
AGTHC
AGUBO
AGYEJ
AHHHB
AHJVU
AI.
AIEXJ
AIIAU
AIKHN
AITUG
AJBFU
AJOXV
AJWLA
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
APLSM
ASPBG
AVWKF
AXJTR
AXLSJ
AZFZN
BEHZQ
BEZPJ
BGSCR
BJAXD
BKOJK
BKOMP
BLXMC
BNTGB
BPUDD
BULVW
BZJEE
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
GBLVA
HAMUX
HLX
HVGLF
HZ~
IHE
IXIXF
J1W
JJJVA
KOM
LG8
LY1
LY7
M41
MO0
MS~
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
R2-
RIG
ROL
RPZ
RXW
SBM
SDF
SDG
SDP
SDS
SES
SET
SEW
SPC
SPCBC
SSB
SSD
SSF
SST
SSZ
T5K
TAE
TN5
U5U
VH1
WUQ
YK3
~02
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
ADVLN
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
1XC
VOOES
ID FETCH-LOGICAL-c443t-62bad03ff616dd76c2ee34ed836446ecb6f2036b0f79f19caa601ff524f2eee3
ISICitedReferencesCount 12
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000444357100021&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0925-5273
IngestDate Thu Nov 06 12:45:22 EST 2025
Tue Nov 18 22:27:25 EST 2025
Sat Nov 29 03:48:16 EST 2025
Fri Feb 23 02:27:15 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Keywords Capacitated parallel machines
Polynomial time algorithm
Energy
Lot sizing problem
Complexity
complexity
capacitated parallel machines
polynomial time algorithm
energy
Language English
License licence_http://creativecommons.org/publicdomain/zero/: http://creativecommons.org/publicdomain/zero
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c443t-62bad03ff616dd76c2ee34ed836446ecb6f2036b0f79f19caa601ff524f2eee3
ORCID 0000-0003-4987-8933
0000-0003-0538-7112
OpenAccessLink https://hal.science/hal-01837881
PageCount 10
ParticipantIDs hal_primary_oai_HAL_hal_01837881v1
crossref_citationtrail_10_1016_j_ijpe_2018_06_020
crossref_primary_10_1016_j_ijpe_2018_06_020
elsevier_sciencedirect_doi_10_1016_j_ijpe_2018_06_020
PublicationCentury 2000
PublicationDate 2018-09-01
PublicationDateYYYYMMDD 2018-09-01
PublicationDate_xml – month: 09
  year: 2018
  text: 2018-09-01
  day: 01
PublicationDecade 2010
PublicationTitle International journal of production economics
PublicationYear 2018
Publisher Elsevier B.V
Elsevier [1991-....]
Publisher_xml – name: Elsevier B.V
– name: Elsevier [1991-....]
References Santos, Almada-Lobo (bib21) 2012; 63
Schulze, Nehler, Ottosson, Thollander (bib23) 2016; 112
Tang, Che, Liu (bib24) 2012; 39
Biel, Glock (bib2) 2016; 101
Masmoudi, Yalaoui, Ouazene, Chehade (bib12) 2017; 55
Özdamar, Birbil (bib18) 1999; 58
Ngueveu, Artigues, Lopez (bib17) 2016; 208
Rapine, Penz, Gicquel, Akbalik (bib20) 2018
Gahm, Denz, Dirr, Tuma (bib9) 2016; 248
Florian, Klein (bib7) 1971; 18
Karmarkar, Kekre, Kekre (bib11) 1987; 35
May, Stahl, Taisch, Kiritsis (bib13) 2017; 167
Brahimi, Dauzère-Pérès, Najid, Nordli (bib4) 2006; 168
Uzel (bib25) 2004
Schultz, Sellmaier, Reinhart (bib22) 2015; 29
Waldemarsson, Lidestam, Rudberg (bib27) 2013; 112
Modos, Sucha, Hanzalek (bib14) 2017; 112
Pochet, Wolsey (bib19) 2006
Artigues, Lopez, Haït (bib1) 2013; 143
Nattaf, Artigues, Lopez (bib15) 2015; 20
Wagner, Whitin (bib26) 1958; 5
Nattaf, Artigues, Lopez, Rivreau (bib16) 2016; 38
Florian, Lenstra, Rinnooy Kan (bib8) 1980; 26
Brahimi, Absi, Dauzère-Pérès, Nordli (bib5) 2017
Ding, Song, Zhang, Chiong, Wu (bib6) 2016; 13
Giglio, Paolucci, Roshani (bib10) 2017; 148
Bitran, Yanasse (bib3) 1982; 28
Zhao, Ierapetritou, Rong (bib28) 2016; 87
Nattaf (10.1016/j.ijpe.2018.06.020_bib16) 2016; 38
Özdamar (10.1016/j.ijpe.2018.06.020_bib18) 1999; 58
Florian (10.1016/j.ijpe.2018.06.020_bib7) 1971; 18
Tang (10.1016/j.ijpe.2018.06.020_bib24) 2012; 39
May (10.1016/j.ijpe.2018.06.020_bib13) 2017; 167
Biel (10.1016/j.ijpe.2018.06.020_bib2) 2016; 101
Zhao (10.1016/j.ijpe.2018.06.020_bib28) 2016; 87
Artigues (10.1016/j.ijpe.2018.06.020_bib1) 2013; 143
Santos (10.1016/j.ijpe.2018.06.020_bib21) 2012; 63
Gahm (10.1016/j.ijpe.2018.06.020_bib9) 2016; 248
Brahimi (10.1016/j.ijpe.2018.06.020_bib4) 2006; 168
Waldemarsson (10.1016/j.ijpe.2018.06.020_bib27) 2013; 112
Karmarkar (10.1016/j.ijpe.2018.06.020_bib11) 1987; 35
Rapine (10.1016/j.ijpe.2018.06.020_bib20) 2018
Wagner (10.1016/j.ijpe.2018.06.020_bib26) 1958; 5
Giglio (10.1016/j.ijpe.2018.06.020_bib10) 2017; 148
Nattaf (10.1016/j.ijpe.2018.06.020_bib15) 2015; 20
Modos (10.1016/j.ijpe.2018.06.020_bib14) 2017; 112
Brahimi (10.1016/j.ijpe.2018.06.020_bib5) 2017
Schulze (10.1016/j.ijpe.2018.06.020_bib23) 2016; 112
Ding (10.1016/j.ijpe.2018.06.020_bib6) 2016; 13
Schultz (10.1016/j.ijpe.2018.06.020_bib22) 2015; 29
Uzel (10.1016/j.ijpe.2018.06.020_bib25) 2004
Masmoudi (10.1016/j.ijpe.2018.06.020_bib12) 2017; 55
Florian (10.1016/j.ijpe.2018.06.020_bib8) 1980; 26
Ngueveu (10.1016/j.ijpe.2018.06.020_bib17) 2016; 208
Bitran (10.1016/j.ijpe.2018.06.020_bib3) 1982; 28
Pochet (10.1016/j.ijpe.2018.06.020_bib19) 2006
References_xml – volume: 39
  start-page: 1977
  year: 2012
  end-page: 1987
  ident: bib24
  article-title: A stochastic production planning problem with nonlinear cost
  publication-title: Comput. Oper. Res.
– volume: 55
  start-page: 1640
  year: 2017
  end-page: 1663
  ident: bib12
  article-title: Lot-sizing in a multi-stage flow line production system with energy consideration
  publication-title: Int. J. Prod. Res.
– volume: 248
  start-page: 744
  year: 2016
  end-page: 757
  ident: bib9
  article-title: Energy-efficient scheduling in manufacturing companies: a review and research framework
  publication-title: Eur. J. Oper. Res.
– volume: 63
  start-page: 1
  year: 2012
  end-page: 12
  ident: bib21
  article-title: Integrated pulp and paper mill planning and scheduling
  publication-title: Comput. Ind. Eng.
– year: 2004
  ident: bib25
  article-title: A Mathematical Modeling Approach to Energy Cost Saving in a Manufacturing Plant
– volume: 87
  start-page: 1
  year: 2016
  end-page: 12
  ident: bib28
  article-title: Production planning optimization of an ethylene plant considering process operation and energy utilization
  publication-title: Comput. Chem. Eng.
– volume: 35
  start-page: 389
  year: 1987
  end-page: 398
  ident: bib11
  article-title: The dynamic lot-sizing problem with startup and reservation costs
  publication-title: Oper. Res.
– volume: 18
  start-page: 12
  year: 1971
  end-page: 20
  ident: bib7
  article-title: Deterministic production planning with concave costs and capacity constraints
  publication-title: Manag. Sci.
– volume: 168
  start-page: 1
  year: 2006
  end-page: 16
  ident: bib4
  article-title: Single item lot sizing problems
  publication-title: Eur. J. Oper. Res.
– volume: 58
  start-page: 115
  year: 1999
  end-page: 129
  ident: bib18
  article-title: A hierarchical planning system for energy intensive production environments
  publication-title: Int. J. Prod. Econ.
– volume: 112
  start-page: 1056
  year: 2013
  end-page: 1065
  ident: bib27
  article-title: Including energy in supply chain planning at a pulp company
  publication-title: Appl. Energy
– year: 2018
  ident: bib20
  article-title: Capacity acquisition for the single-item lot sizing problem under energy constraints
  publication-title: Omega
– volume: 38
  start-page: 459
  year: 2016
  end-page: 492
  ident: bib16
  article-title: Energetic reasoning and mixed-integer linear programming for scheduling with a continuous resource and linear efficiency functions
  publication-title: Spectrum
– year: 2006
  ident: bib19
  article-title: Production Planning by Mixed Integer Programming
– volume: 167
  start-page: 1464
  year: 2017
  end-page: 1489
  ident: bib13
  article-title: Energy management in manufacturing: from literature review to a conceptual framework
  publication-title: J. Clean. Prod.
– volume: 29
  start-page: 197
  year: 2015
  end-page: 202
  ident: bib22
  article-title: An approach for energy-oriented production control using energy flexibility
  publication-title: Proc. CIRP
– volume: 101
  start-page: 243
  year: 2016
  end-page: 259
  ident: bib2
  article-title: Systematic literature review of decision support models for energy-efficient production planning
  publication-title: Comput. Ind. Eng.
– volume: 13
  start-page: 1138
  year: 2016
  end-page: 1154
  ident: bib6
  article-title: Parallel machine scheduling under time-of-use electricity prices: new models and optimization approaches
  publication-title: IEEE Trans. Autom. Sci. Eng.
– volume: 112
  start-page: 3692
  year: 2016
  end-page: 3708
  ident: bib23
  article-title: Energy management in industry - a systematic review of previous findings and an integrative conceptual framework
  publication-title: J. Clean. Prod.
– year: 2017
  ident: bib5
  article-title: Single-item dynamic lot-sizing problems: an updated survey
  publication-title: Eur. J. Oper. Res.
– volume: 148
  start-page: 624
  year: 2017
  end-page: 641
  ident: bib10
  article-title: Integrated lot sizing and energy-efficient job shop scheduling problem in manufacturing/remanufacturing systems
  publication-title: J. Clean. Prod.
– volume: 28
  start-page: 1174
  year: 1982
  end-page: 1186
  ident: bib3
  article-title: Computational complexity of the capacitated lot size problem
  publication-title: Manag. Sci.
– volume: 20
  start-page: 304
  year: 2015
  end-page: 324
  ident: bib15
  article-title: A hybrid exact method for a scheduling problem with a continuous resource and energy constraints
  publication-title: Constraints
– volume: 5
  start-page: 89
  year: 1958
  end-page: 96
  ident: bib26
  article-title: Dynamic version of the economic lot size model
  publication-title: Manag. Sci.
– volume: 143
  start-page: 13
  year: 2013
  end-page: 23
  ident: bib1
  article-title: The energy scheduling problem: industrial case-study and constraint propagation techniques
  publication-title: Int. J. Prod. Econ.
– volume: 208
  start-page: 98
  year: 2016
  end-page: 113
  ident: bib17
  article-title: Scheduling under a nonreversible energy source: an application of piecewise linear bounding of non-linear demand/cost functions
  publication-title: Discrete Appl. Math.
– volume: 26
  start-page: 669
  year: 1980
  end-page: 679
  ident: bib8
  article-title: Deterministic production planning: algorithms and complexity
  publication-title: Manag. Sci.
– volume: 112
  start-page: 391
  year: 2017
  end-page: 408
  ident: bib14
  article-title: Algorithms for robust production scheduling with energy consumption limits
  publication-title: Comput. Ind. Eng.
– volume: 13
  start-page: 1138
  issue: 2
  year: 2016
  ident: 10.1016/j.ijpe.2018.06.020_bib6
  article-title: Parallel machine scheduling under time-of-use electricity prices: new models and optimization approaches
  publication-title: IEEE Trans. Autom. Sci. Eng.
  doi: 10.1109/TASE.2015.2495328
– volume: 18
  start-page: 12
  issue: 1
  year: 1971
  ident: 10.1016/j.ijpe.2018.06.020_bib7
  article-title: Deterministic production planning with concave costs and capacity constraints
  publication-title: Manag. Sci.
  doi: 10.1287/mnsc.18.1.12
– year: 2017
  ident: 10.1016/j.ijpe.2018.06.020_bib5
  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: 55
  start-page: 1640
  issue: 6
  year: 2017
  ident: 10.1016/j.ijpe.2018.06.020_bib12
  article-title: Lot-sizing in a multi-stage flow line production system with energy consideration
  publication-title: Int. J. Prod. Res.
  doi: 10.1080/00207543.2016.1206670
– volume: 38
  start-page: 459
  issue: 2
  year: 2016
  ident: 10.1016/j.ijpe.2018.06.020_bib16
  article-title: Energetic reasoning and mixed-integer linear programming for scheduling with a continuous resource and linear efficiency functions
  publication-title: Spectrum
  doi: 10.1007/s00291-015-0423-x
– volume: 39
  start-page: 1977
  year: 2012
  ident: 10.1016/j.ijpe.2018.06.020_bib24
  article-title: A stochastic production planning problem with nonlinear cost
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2011.09.007
– volume: 168
  start-page: 1
  issue: 1
  year: 2006
  ident: 10.1016/j.ijpe.2018.06.020_bib4
  article-title: Single item lot sizing problems
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2004.01.054
– volume: 28
  start-page: 1174
  issue: 10
  year: 1982
  ident: 10.1016/j.ijpe.2018.06.020_bib3
  article-title: Computational complexity of the capacitated lot size problem
  publication-title: Manag. Sci.
  doi: 10.1287/mnsc.28.10.1174
– volume: 143
  start-page: 13
  year: 2013
  ident: 10.1016/j.ijpe.2018.06.020_bib1
  article-title: The energy scheduling problem: industrial case-study and constraint propagation techniques
  publication-title: Int. J. Prod. Econ.
  doi: 10.1016/j.ijpe.2010.09.030
– year: 2006
  ident: 10.1016/j.ijpe.2018.06.020_bib19
– volume: 112
  start-page: 391
  year: 2017
  ident: 10.1016/j.ijpe.2018.06.020_bib14
  article-title: Algorithms for robust production scheduling with energy consumption limits
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2017.08.011
– year: 2018
  ident: 10.1016/j.ijpe.2018.06.020_bib20
  article-title: Capacity acquisition for the single-item lot sizing problem under energy constraints
  publication-title: Omega
  doi: 10.1016/j.omega.2017.10.004
– volume: 112
  start-page: 3692
  year: 2016
  ident: 10.1016/j.ijpe.2018.06.020_bib23
  article-title: Energy management in industry - a systematic review of previous findings and an integrative conceptual framework
  publication-title: J. Clean. Prod.
  doi: 10.1016/j.jclepro.2015.06.060
– volume: 208
  start-page: 98
  year: 2016
  ident: 10.1016/j.ijpe.2018.06.020_bib17
  article-title: Scheduling under a nonreversible energy source: an application of piecewise linear bounding of non-linear demand/cost functions
  publication-title: Discrete Appl. Math.
  doi: 10.1016/j.dam.2016.03.001
– volume: 5
  start-page: 89
  issue: 1
  year: 1958
  ident: 10.1016/j.ijpe.2018.06.020_bib26
  article-title: Dynamic version of the economic lot size model
  publication-title: Manag. Sci.
  doi: 10.1287/mnsc.5.1.89
– volume: 101
  start-page: 243
  year: 2016
  ident: 10.1016/j.ijpe.2018.06.020_bib2
  article-title: Systematic literature review of decision support models for energy-efficient production planning
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2016.08.021
– volume: 112
  start-page: 1056
  year: 2013
  ident: 10.1016/j.ijpe.2018.06.020_bib27
  article-title: Including energy in supply chain planning at a pulp company
  publication-title: Appl. Energy
  doi: 10.1016/j.apenergy.2012.12.032
– volume: 26
  start-page: 669
  issue: 7
  year: 1980
  ident: 10.1016/j.ijpe.2018.06.020_bib8
  article-title: Deterministic production planning: algorithms and complexity
  publication-title: Manag. Sci.
  doi: 10.1287/mnsc.26.7.669
– volume: 63
  start-page: 1
  year: 2012
  ident: 10.1016/j.ijpe.2018.06.020_bib21
  article-title: Integrated pulp and paper mill planning and scheduling
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2012.01.008
– volume: 35
  start-page: 389
  issue: 3
  year: 1987
  ident: 10.1016/j.ijpe.2018.06.020_bib11
  article-title: The dynamic lot-sizing problem with startup and reservation costs
  publication-title: Oper. Res.
  doi: 10.1287/opre.35.3.389
– volume: 167
  start-page: 1464
  year: 2017
  ident: 10.1016/j.ijpe.2018.06.020_bib13
  article-title: Energy management in manufacturing: from literature review to a conceptual framework
  publication-title: J. Clean. Prod.
  doi: 10.1016/j.jclepro.2016.10.191
– volume: 148
  start-page: 624
  year: 2017
  ident: 10.1016/j.ijpe.2018.06.020_bib10
  article-title: Integrated lot sizing and energy-efficient job shop scheduling problem in manufacturing/remanufacturing systems
  publication-title: J. Clean. Prod.
  doi: 10.1016/j.jclepro.2017.01.166
– volume: 87
  start-page: 1
  year: 2016
  ident: 10.1016/j.ijpe.2018.06.020_bib28
  article-title: Production planning optimization of an ethylene plant considering process operation and energy utilization
  publication-title: Comput. Chem. Eng.
  doi: 10.1016/j.compchemeng.2016.01.002
– volume: 20
  start-page: 304
  issue: 3
  year: 2015
  ident: 10.1016/j.ijpe.2018.06.020_bib15
  article-title: A hybrid exact method for a scheduling problem with a continuous resource and energy constraints
  publication-title: Constraints
  doi: 10.1007/s10601-015-9192-z
– year: 2004
  ident: 10.1016/j.ijpe.2018.06.020_bib25
– volume: 29
  start-page: 197
  year: 2015
  ident: 10.1016/j.ijpe.2018.06.020_bib22
  article-title: An approach for energy-oriented production control using energy flexibility
  publication-title: Proc. CIRP
  doi: 10.1016/j.procir.2015.02.038
– volume: 248
  start-page: 744
  year: 2016
  ident: 10.1016/j.ijpe.2018.06.020_bib9
  article-title: Energy-efficient scheduling in manufacturing companies: a review and research framework
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2015.07.017
– volume: 58
  start-page: 115
  year: 1999
  ident: 10.1016/j.ijpe.2018.06.020_bib18
  article-title: A hierarchical planning system for energy intensive production environments
  publication-title: Int. J. Prod. Econ.
  doi: 10.1016/S0925-5273(98)00076-0
SSID ssj0007188
Score 2.3356729
Snippet The single-item lot sizing problem under a periodic energy limitation is considered in this paper. Identical and parallel capacitated machines constitute the...
SourceID hal
crossref
elsevier
SourceType Open Access Repository
Enrichment Source
Index Database
Publisher
StartPage 254
SubjectTerms Capacitated parallel machines
Complexity
Computer Science
Energy
Lot sizing problem
Operations Research
Polynomial time algorithm
Title Energy-aware lot sizing problem: Complexity analysis and exact algorithms
URI https://dx.doi.org/10.1016/j.ijpe.2018.06.020
https://hal.science/hal-01837881
Volume 203
WOSCitedRecordID wos000444357100021&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-7579
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0007188
  issn: 0925-5273
  databaseCode: AIEXJ
  dateStart: 19950301
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3fb9MwELa6DSF4QDBAjF-KEG9TUGwnccxbhYo2NE1I9KFvUeLYLF1JqzbtOl75x7mLnaRiYgIkXiLLchLL9-XOvtx9R8hblhdxpjLpy0BLP4xzaEkW-4LTSHChQlM0VUvOxPl5MpnIz4PBjzYXZjMTVZVst3LxX0UNfSBsTJ39C3F3D4UOaIPQ4Qpih-sfCX7UZPP52RXGdM3m9fGq_G5TzpvSMegCQCWARJg1ki85UhJ0oOstZkxms6_zZVlfOB7zaR_r3rsOdwgnFpYzFmGkXZZzHz-fLUrrMu1JDLqIn3m5AqPUOObXWPto_a2H32UO54NGUQ-v3e8j55qgSRd75fxlN3JmrOORRT7SvlkLZNVuIrgvIltWptXLLOC7mtVyTTsjzaxWvKH_rSti-q6cLpADlVpyVhb01q6LQfyCE8F5UKRAi8NgjxwwEUlQjQfD09HkU2fQwXw3Br2duMu9smGCv77pd_ubvYvWU9_sXMYPyQN35PCGFiqPyEBXh-Rum_FwSO7vcFI-Jqe7-PEAP57Fj-fw897r0eO16IFG4TXo8Xr0PCHjj6PxhxPf1dvwVRjy2o9ZnhUBNyamcVGIWDGteaiLhMOmOdYqjw3-ts4DI6ShUmUZnOaNiVhoYKTmT8l-Na_0M-LJnCuus6jgRoc011IxFVJtNEu0yCg7IrRdpFQ5LnosiTJL26DDaYoLm-LCphh5yYIjctzds7BMLLeOjtq1T91e0u4RU4DKrfe9AUF1L0Dy9ZPhWYp9MKgpvrChz__x4S_Ivf4zeUn26-VavyJ31KYuV8vXDnY_AayVp28
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=Energy-aware+lot+sizing+problem%3A+Complexity+analysis+and+exact+algorithms&rft.jtitle=International+journal+of+production+economics&rft.au=Rapine%2C+Christophe&rft.au=Goisque%2C+Guillaume&rft.au=Akbalik%2C+Ayse&rft.date=2018-09-01&rft.pub=Elsevier+B.V&rft.issn=0925-5273&rft.eissn=1873-7579&rft.volume=203&rft.spage=254&rft.epage=263&rft_id=info:doi/10.1016%2Fj.ijpe.2018.06.020&rft.externalDocID=S0925527318302640
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0925-5273&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0925-5273&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0925-5273&client=summon