2020
DOI: 10.1007/s10845-019-01521-9
|View full text |Cite
|
Sign up to set email alerts
|

A memetic algorithm for multi-objective distributed production scheduling: minimizing the makespan 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
9
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 41 publications
(9 citation statements)
references
References 49 publications
0
9
0
Order By: Relevance
“…Please insert Fig. 1 here Also, assumptions declared to describe the studied scheduling problem are organized as follows: (1) No job can be processed on two or more machines at a time, and a machine can only process one job at a time; (2) Once a job is processed on a specific machine, it will stay on the machine until finished; (3) Jobs travels sequentially through all stages and stage skipping of all jobs is not permitted; (4) A job will be transported to next processing stage instantly once it is finished at a specific stage, and transportation times for jobs between any two consecutive stages are ignored; (5) Machines are in good condition and random failures are not considered; (6) Setup times are sequence-independent, thus could be included in processing time; (7) Machines will be turned on once the first job assigned to them and will be shut down once all jobs assigned to them are finished.…”
Section: Problem Descriptionmentioning
confidence: 99%
See 2 more Smart Citations
“…Please insert Fig. 1 here Also, assumptions declared to describe the studied scheduling problem are organized as follows: (1) No job can be processed on two or more machines at a time, and a machine can only process one job at a time; (2) Once a job is processed on a specific machine, it will stay on the machine until finished; (3) Jobs travels sequentially through all stages and stage skipping of all jobs is not permitted; (4) A job will be transported to next processing stage instantly once it is finished at a specific stage, and transportation times for jobs between any two consecutive stages are ignored; (5) Machines are in good condition and random failures are not considered; (6) Setup times are sequence-independent, thus could be included in processing time; (7) Machines will be turned on once the first job assigned to them and will be shut down once all jobs assigned to them are finished.…”
Section: Problem Descriptionmentioning
confidence: 99%
“…Eq. (1) shows the total carbon emission in the shop, elements in brackets refers to total energy consumption in the period. According to [40], there exists a linear relationship between carbon emission and energy consumption in manufacturing.…”
Section: Two Optimization Objectivesmentioning
confidence: 99%
See 1 more Smart Citation
“…For scheduling objectives, the completion time-related and machine workload-related ones are the most evaluated. Energy consumption and low-carbon-related objectives are attracting increasing attention; they can be considered as one of multiple objectives and simultaneously optimized with traditional objectives [46,60,[85][86][87][90][91][92][93] .…”
Section: Problemmentioning
confidence: 99%
“…Jiang et al (2020) proposed an effective modified multi-objective evolutionary algorithm with decomposition (MMOEA/D) to minimize energy consumption and makespan. While in all the abovementioned studies, it is assumed that all operations of a job should be performed on the machines of the same facility, Luo et al (2020) and Gong et al (2020) assume that operations of a job can be transferred among different facilities taking into account the jobs' transfer time and transfer energy consumption. For an overview of more related studies on production planning and scheduling problems in multi-factory production networks as well as a more comprehensive classification, see Lohmer and Lasch (2020).…”
Section: Literature Reviewmentioning
confidence: 99%