2016
DOI: 10.1016/j.jclepro.2015.09.097
|View full text |Cite
|
Sign up to set email alerts
|

Solving the energy-efficient job shop scheduling problem: a multi-objective genetic algorithm with enhanced local search for minimizing the total weighted tardiness and total energy consumption

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
109
0
1

Year Published

2017
2017
2022
2022

Publication Types

Select...
4
2
2

Relationship

1
7

Authors

Journals

citations
Cited by 279 publications
(110 citation statements)
references
References 39 publications
0
109
0
1
Order By: Relevance
“…There are a number of recent studies, including those by the authors, who consider reduction of energy consumption in the framework of production scheduling optimization. 7,8 However, these studies give just an ancillary consideration to energy reduction when optimizing production schedules, not going as far as to consider optimal operation of energy plants. Yet, tertiary energy loads vary with production schedules, and optimal operation of energy plants must be considered with regard to such variation.…”
Section: Trends and Issues In Recent Researchmentioning
confidence: 99%
“…There are a number of recent studies, including those by the authors, who consider reduction of energy consumption in the framework of production scheduling optimization. 7,8 However, these studies give just an ancillary consideration to energy reduction when optimizing production schedules, not going as far as to consider optimal operation of energy plants. Yet, tertiary energy loads vary with production schedules, and optimal operation of energy plants must be considered with regard to such variation.…”
Section: Trends and Issues In Recent Researchmentioning
confidence: 99%
“…Constraints (9) and (10) force z kh to take 1 if the family type of B kh is different from that of B k(h−1) . Equation (11) calculates the finishing time of the first batch on each machine (F k1 ), and then Equation (12) calculates the finishing time of each subsequent batch (F kh ) by adding up the batch processing times and the setup times. Equation (13) defines the completion time (C i ) of job i, which is equal to F kh if job i has been allocated to B kh .…”
Section: The Linear Programming Formulationmentioning
confidence: 99%
“…Therefore, a trade-off must be made between production efficiency and energy usage. The speed scaling framework has been utilized in subsequent research such as [10][11][12][13] for single machine or job shop production environments. The above-mentioned and many other existing works all focus on the minimization of energy consumption for achieving sustainable manufacturing (based on the fact that electricity generation will normally produce carbon emissions).…”
Section: Introductionmentioning
confidence: 99%
“…The former configurations remained for fair comparison. Three metrics were used to indicate the MOO performance (Zhang and Chiong, 2016): (1) NS(ts), the number of non-dominated solutions given by time slot ts; (2) RN(ts), the degree of Pareto optimality of the non-dominated solutions output by ts; (3) TS(ts), the evenness of non-dominated solution distribution of ts.…”
Section: Scalability In Number Of Time Slotsmentioning
confidence: 99%