2019
DOI: 10.1016/j.ijpe.2019.03.021
|View full text |Cite
|
Sign up to set email alerts
|

Job-shop scheduling problem with energy consideration

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
20
0
1

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 69 publications
(21 citation statements)
references
References 25 publications
0
20
0
1
Order By: Relevance
“…(2018b), Bürgy and Bülbül (2018), Masmoudi et al. (2019), Gong et al. (2019), Jamili (2019), Morikawa et al.…”
Section: An Overview Of Shop Scheduling Problems Characteristicsmentioning
confidence: 99%
“…(2018b), Bürgy and Bülbül (2018), Masmoudi et al. (2019), Gong et al. (2019), Jamili (2019), Morikawa et al.…”
Section: An Overview Of Shop Scheduling Problems Characteristicsmentioning
confidence: 99%
“…Masmoudi et al [100] proposed two integer linear programming models to minimize the energy production costs under power peak constraints and used a heuristic method to solve the mathematical problem.…”
Section: Classical Job Shopmentioning
confidence: 99%
“…In recent years, due to rising energy costs and environmental concerns, researchers have started working on energy-efficient scheduling problems as a main feature of JSSP. Two integer programming models were for example used in [4], namely a disjunctive and a time-indexed formulation, to solve the JSSP in order to minimize electricity cost. A scheduling model with the turn off/turn on of machines was introduced in [5], and a multi-objective genetic algorithm based on non-dominated sorting genetic algorithm NSGA-II was developed to minimize the energy consumption and total weighted tardiness simultaneously.…”
Section: Job Shop Energy-efficient Schedulingmentioning
confidence: 99%