2020
DOI: 10.1016/j.eswa.2020.113721
|View full text |Cite
|
Sign up to set email alerts
|

An efficient memetic algorithm for distributed flexible job shop scheduling problem with transfers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
20
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 100 publications
(22 citation statements)
references
References 42 publications
0
20
0
Order By: Relevance
“…Nevertheless, there are a few exceptions. Some authors [37,38,85,[87][88][89][90][91][92] schedule transport and take into account the energy required to load/unload vehicles, and others [93][94][95][96][97][98] consider the energy required to transport the jobs between geographically distributed facilities.…”
Section: Pp = Maxmentioning
confidence: 99%
See 1 more Smart Citation
“…Nevertheless, there are a few exceptions. Some authors [37,38,85,[87][88][89][90][91][92] schedule transport and take into account the energy required to load/unload vehicles, and others [93][94][95][96][97][98] consider the energy required to transport the jobs between geographically distributed facilities.…”
Section: Pp = Maxmentioning
confidence: 99%
“…Other subproblems that impact the total energy consumption have been considered, although less frequently: layout optimization (LOP) [86,89]-machine location (and reallocation) is determined at the same time that the manufacturing operations are scheduled; job process planning (JPP) [14]-job routing is chosen from a set of predefined job routes; batch scheduling (BS) [62]-machines are set up to process a batch of similar operations; and distributed manufacturing scheduling (DMS) [93,94,98,121,122]-operations may be processed on machines that are located in different factories, which are geographically distributed. Among these, we highlight the last two, since they address non-identical factories and consider the three pillars of sustainability (economic, social, and environmental), thus complying with the triple bottom line principle.…”
Section: Additional Scheduling Problemsmentioning
confidence: 99%
“…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%