2014
DOI: 10.2139/ssrn.2447152
|View full text |Cite
|
Sign up to set email alerts
|

Taxonomy of Shop Scheduling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 15 publications
0
2
0
Order By: Relevance
“…We review the literature, revealing the concepts and methodologies that most impact the usage of scheduling theory in manufacturing environments. Brucker (2007) and other authors name the scheduling problems arising in manufacturing environments by shop scheduling problems (SSP) (see also Bahouth, 2014). In such problems, we are given a set of jobs J=false{j1,,jnfalse}$J = \lbrace j_1,\ldots ,j_n\rbrace$ and a set of machines M=false{m1,,mmfalse}$M = \lbrace m_1,\ldots ,m_m\rbrace$ where the jobs must be processed.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…We review the literature, revealing the concepts and methodologies that most impact the usage of scheduling theory in manufacturing environments. Brucker (2007) and other authors name the scheduling problems arising in manufacturing environments by shop scheduling problems (SSP) (see also Bahouth, 2014). In such problems, we are given a set of jobs J=false{j1,,jnfalse}$J = \lbrace j_1,\ldots ,j_n\rbrace$ and a set of machines M=false{m1,,mmfalse}$M = \lbrace m_1,\ldots ,m_m\rbrace$ where the jobs must be processed.…”
Section: Introductionmentioning
confidence: 99%
“…Multiple characteristics, interrelated concepts, and different solution methods have resulted in most of the work reported in the literature on scheduling problems showing a very compartmentalized view of the problem scope within the area in which the research is being carried out. The broad literature and a large number of application articles are such that although the class of shop scheduling problems encompasses several specific problem variants defined by different characteristics and constraints (Bahouth, 2014), they are often referred to by alternative names or by more general or particular cases such as scheduling problem (Pinedo, 2005, 2012), job shop scheduling problem (Arisha and Young, 2001; Tamssaouet et al., 2018; Ahmadian et al., 2020), job shop scheduling (Dechter, 2003), group scheduling problem (Hoos and Stützle, 2005), job scheduling problem (Chen et al., 2010), machine scheduling problem (Mnich and van Bevern, 2018), and production scheduling problem (Ghaleb et al., 2020; Wan et al., 2020).…”
Section: Introductionmentioning
confidence: 99%