2018
DOI: 10.1016/j.cie.2018.05.035
|View full text |Cite
|
Sign up to set email alerts
|

A new model of parallel-machine scheduling with integral-based learning effect

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 21 publications
(4 citation statements)
references
References 19 publications
0
4
0
Order By: Relevance
“…In the parallel machine scheduling model, the total weighted earliness and tardiness instead of job tardiness are considered. Przybylski (2018) introduced a new model of parallel-machine scheduling with job processing times described by proper Riemann integrals of a given function. Gedik et al.…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…In the parallel machine scheduling model, the total weighted earliness and tardiness instead of job tardiness are considered. Przybylski (2018) introduced a new model of parallel-machine scheduling with job processing times described by proper Riemann integrals of a given function. Gedik et al.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In the parallel machine scheduling model, the total weighted earliness and tardiness instead of job tardiness are considered. Przybylski (2018) introduced a new model of parallel-machine scheduling with job processing times described by proper Riemann integrals of a given function. Gedik et al (2016) proposed a constraint programming model and logic-based Benders algorithms to make the best decisions for scheduling nonidentical jobs with availability intervals and sequence-dependent setup times on unrelated parallel machines in a fixed planning horizon.…”
Section: Multiproject Scheduling and Resource Managementmentioning
confidence: 99%
“…Other studies have validated DeJong's learning model, e.g., Okolowski and Gawiejnowicz [6] and Ji et al [7,8]. More recent papers which have considered scheduling problems with learning effect include studies of Wang and Wang and Wang [9,10]; Wang et al [11]; Xu et al [12]; Chen et al [13]; Toksari and Arik [14]; Bai et al [15]; Mustu and Eren [16]; Pei et al [17]; Zhang et al [18]; Wang and Wang [19,20]; Wang et al [21], and Przybylski [22].…”
Section: Review Of Existing Modelsmentioning
confidence: 99%
“…Considering the effect of learning alone on scheduling problems, one can refer to the articles of Lee et al [13] by examining the problem of uniform parallel machine scheduling; Goli et al [14] considered both the effect of learning and the delivery time of goods; Przybylski [15] considered the effect of integral learning; Expósito-Izquierdo et al [16] noted the addition of sequence-dependent setup times. Taking into account both the learning effect and the effect of degradation in the deterministic environment, Toksarı and Güner [17] investigated the problem of identical parallel machine scheduling with the aim of minimizing ET and nonlinear degradation coefficients and common delivery times.…”
Section: Introductionmentioning
confidence: 99%