A survey of scheduling problems with setup times or costs
By Ali Allahverdi, Chi To Ng, T. C. Edwin Cheng, Mikhail Y. Kovalyov. European Journal of Operational Research, 2008
1,432 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Industrial and Manufacturing Engineering
View Paper: https://www.semanticscholar.org/paper/1eaeb94368896c4e8679fb1dd072fe7ecef95d0f
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
In Industrial and Manufacturing Engineering
- Eva Vallada
- José Antonio Vázquez Rodríguez
- Reza Tavakkoli-Moghaddam
- Rubén Ruiz
- Dong-Ho Lee
- Jan Weglarz
- Morteza Mousakhani
- Grzegorz Waligóra
Citations in the corpus
- The hybrid flow shop scheduling problem (2010, background): “The recent review paper of [9] and the study of setup importance from [10] are just some examples.”
- Project scheduling with finite or infinite number of activity processing modes - A survey (2011, methodology): “There are two types of setup times directly taken from the machine scheduling theory: sequence-independent and sequence-dependent ones (see, e.g. Allahverdi et al., 1999, 2008).”
- Sequence-dependent setup time flexible job shop scheduling problem to minimise total tardiness (2013, methodology): “In this paper, we study FJSSP with sequence dependent setup times (SDST FJSSP) which is a practical extension of the problem (Allahverdi et al. 2008). Although the minimisation of makespan is regularly used, due date related criteria have become each time more important than those based on makespan ”
- A tabu search algorithm for unrelated parallel machine scheduling with sequence- and machine-dependent setups: minimizing total tardiness (2013, background): “See Cheng and Sin [11], Koulamas [12], and Allahverdi [13] for literature reviews on various parallel machine scheduling problems.”
- A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times (2011, methodology): “However, most of them are able to solve instances with a few number of jobs and machines (more details in Allahverdi et al. (2008)).”
- A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times (2015, background): “[2] conducted a comprehensive review on these problems.”