2016
DOI: 10.5267/j.ijiec.2016.2.002
|View full text |Cite
|
Sign up to set email alerts
|

Efficient priority rules for dynamic sequencing with sequence-dependent setups

Abstract: This article addresses the problem of dynamic sequencing on n identical parallel machines with stochastic arrivals, processing times, due dates and sequence-dependent setups. The system operates under a completely reactive scheduling policy and the sequence of jobs is determined with the use of dispatching rules. Seventeen existing dispatching rules are considered including standard and setup-oriented rules. The performance of the system is evaluated by four metrics. An experimental study of the system is cond… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
9
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(9 citation statements)
references
References 22 publications
0
9
0
Order By: Relevance
“…In addition, sequence-dependent processing times between jobs have not been taken into account until recently (Vallada & Ruiz, 2011;Sereshti & Bijari, 2013). Furthermore, research papers related to the problem of parallel machine scheduling with setup times/costs have mainly focused on makespan minimization (Vélez-Gallego et al 2016;Xanthopoulos et al, 2016). When addressing due-date related objective functions, the majority of research articles have approached the minimization of tardiness.…”
Section: Scheduling Problemmentioning
confidence: 99%
“…In addition, sequence-dependent processing times between jobs have not been taken into account until recently (Vallada & Ruiz, 2011;Sereshti & Bijari, 2013). Furthermore, research papers related to the problem of parallel machine scheduling with setup times/costs have mainly focused on makespan minimization (Vélez-Gallego et al 2016;Xanthopoulos et al, 2016). When addressing due-date related objective functions, the majority of research articles have approached the minimization of tardiness.…”
Section: Scheduling Problemmentioning
confidence: 99%
“…The effective scheduling in a sense of achievement of a high production performance leads to generating benefits in the form of shortening processing time and reduction of costs. To ensure the changing requirements effectively and to generate suitable production schedules, implementation of heuristics, simulation, analytical models [1,2], artificial intelligence techniques [3], or dispatching rules, especially in case of dynamic scheduling [4,5], can be employed in this type of decision-making.…”
Section: Introductionmentioning
confidence: 99%
“…As an illustration, in the simulation study, Vinod and Sridharan [13] evaluated the performance measures based on flow time and tardiness of jobs for the different combinations of due-date assignment methods and seven scheduling decision rules applied in a dynamic job shop system. Xanthopoulos et al [5] compared seventeen dispatching rules in the study focused on stochastic dynamic scheduling problems with sequence-dependent setups. Performance measures were mean work-in-progress (WIP), mean cycle time, mean tardiness, and a fraction of tardy jobs.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations