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

Flow shop scheduling problem with position-dependent processing times

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(6 citation statements)
references
References 37 publications
0
6
0
Order By: Relevance
“…They must also deal with the limitation that the production planning process is run periodically while the demand situation is continuously changing. They must also manage the contrast between the objectives of long-term planning versus short-term scheduling-that is, levelling versus the minimization of earliness and tardiness and nonexecution [21].…”
Section: Ppc Challengesmentioning
confidence: 99%
“…They must also deal with the limitation that the production planning process is run periodically while the demand situation is continuously changing. They must also manage the contrast between the objectives of long-term planning versus short-term scheduling-that is, levelling versus the minimization of earliness and tardiness and nonexecution [21].…”
Section: Ppc Challengesmentioning
confidence: 99%
“…Equation ( 14) determines the completion time of each scheduled job in position l on M j . The conditions on the variables are controlled by constraints ( 15), ( 16), (17), and (18).…”
Section: Problem Description and Mathematical Modelmentioning
confidence: 99%
“…There is an interest in the literature to study the scheduling problems with deteriorating jobs, formulated numerous models with various criteria and solved by branch and bound (B&B), heuristic, and metaheuristic algorithms [4][5][6][7][8][9][10][11]. Flowshop scheduling problems have received increasing attention in recent years by various assumptions [12][13][14][15][16][17].…”
Section: Introductionmentioning
confidence: 99%
“…Kim and Kim [4] consider single scheduling problems incorporating a ratemodifying activity (RMA) and processing time deterioration rates. For more recent literature involving deterioration, readers can refer to Sánchez-Herrera et al [5]; Wang et al [6]; Ding et al [7]; Zhang et al [8]; Li et al [9]; Soleimani et al [10]; Cheng et al [11]. Wright [12] and Biskup [13] are among the pioneers that brought the topic of learning into the feld of scheduling.…”
Section: Introductionmentioning
confidence: 99%