|
[1]
|
A. Allahverdi, The third comprehensive survey on scheduling problems with setup times/costs, European Journal of Operational Research, 246 (2015), 345-378.
doi: 10.1016/j.ejor.2015.04.004.
|
|
[2]
|
A. Allahverdi, A survey of scheduling problems with no-wait in process, European Journal of Operational Research, 255 (2016), 665-686.
doi: 10.1016/j.ejor.2016.05.036.
|
|
[3]
|
A. Allahverdi, Two-machine flowshop scheduling problem to minimize makespan with bounded setup and processing times, Int. Journal of Agile Manufacturing, 8 (2005), 145-153.
|
|
[4]
|
A. Allahverdi, Two-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times, Int. Journal of Production Economics, 103 (2006a), 386-400.
|
|
[5]
|
A. Allahverdi, Two-machine flowshop scheduling problem to minimize maximum lateness with bounded setup and processing times, Kuwait Journal of Science and Engineering, 33 (2006), 233-251.
|
|
[6]
|
A. Allahverdi, T. Aldowaisan and Y. N. Sotskov, Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times, Int. Journal of Mathematics and Mathematical Sciences, 39 (2003), 2475-2486.
doi: 10.1155/S016117120321019X.
|
|
[7]
|
A. Allahverdi and M. Allahverdi, Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness, Computational and Applied Mathematics, 37 (2018), 6774-6794.
doi: 10.1007/s40314-018-0694-3.
|
|
[8]
|
A. Allahverdi and H. Aydilek, Heuristics for two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times, Computers and Mathematics with Applications, 60 (2010), 1374-1384.
doi: 10.1016/j.camwa.2010.06.019.
|
|
[9]
|
A. Aydilek, H. Aydilek and A. Allahverdi, Increasing the profitability and competitiveness in a production environment with random and bounded setup times, Int. Journal of Production Research, 51 (2013), 106-117.
doi: 10.1080/00207543.2011.652263.
|
|
[10]
|
A. Aydilek, H. Aydilek and A. Allahverdi, Production in a two-machine flowshop scheduling environment with uncertain processing and setup times to minimize makespan, Int. Journal of Production Research, 53 (2015), 2803-2819.
doi: 10.1080/00207543.2014.997403.
|
|
[11]
|
A. Aydilek, H. Aydilek and A. Allahverdi, Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times, Applied Mathematical Modelling, 45 (2017), 982-996.
doi: 10.1016/j.apm.2017.01.039.
|
|
[12]
|
O. Braun, T. C. Lai, G. Schmidt and Y. N. Sotskov, Stability of Johnson's schedule with respect to limited machine availability, Int. Journal of Production Research, 40 (2002), 4381-4400.
|
|
[13]
|
A. A. Cunningham and S. K. Dutta, Scheduling jobs with exponentially distributed processing times on two machines of a flow shop, Naval Research Logistics Quarterly, 20 (1973), 69-81.
doi: 10.1002/nav.3800200107.
|
|
[14]
|
O. Engin and A. Güçlü, A new hybrid ant colony optimization algorithm for solving the no-wait flow shop scheduling problems, Applied Soft Computing Journal, 72 (2018), 166-176.
doi: 10.1016/j.asoc.2018.08.002.
|
|
[15]
|
O. Engin and C. Günaydin, An adaptive learning approach for no-wait flowshop scheduling problems to minimize makespan, International Journal of Computational Intelligence Systems, 4 (2011), 521-529.
doi: 10.1080/18756891.2011.9727810.
|
|
[16]
|
E. M. Gonzalez-Neira, D. Ferone, S. Hatami and A. A. Juan, A biased-randomized simheuristic for the distributed assembly permutation flowshop problem with stochastic processing times, Simulation Modelling Practice and Theory, 79 (2017), 23-36.
doi: 10.1016/j.simpat.2017.09.001.
|
|
[17]
|
N. G. Hall and C. Sriskandarajah, A survey of machine scheduling problems with blocking and no-wait in process, Operations Research, 44 (1996), 510-525.
doi: 10.1287/opre.44.3.510.
|
|
[18]
|
P. J. Kalczynski and J. Kamburowski, A heuristic for minimizing the expected makespan in two-machine flowshops with consistent coefficients of variation, European Journal of Operational Research, 169 (2006), 742-750.
doi: 10.1016/j.ejor.2004.08.045.
|
|
[19]
|
I. H. Karacizmeli and S. N. Ogulata, Energy consumption management in textile finishing plants: A cost effective and sequence dependent scheduling model, Textile and Apparel, 27 (2017), 145-152.
|
|
[20]
|
S. C. Kim and P. M. Bobrowski, Scheduling jobs with uncertain setup times and sequence dependency, Omega Int. Journal of Management Science, 25 (1997), 437-447.
doi: 10.1016/S0305-0483(97)00013-3.
|
|
[21]
|
G. M. Kopanos, J. Miguel Lainez and L. Puigjaner, An efficient mixed-integer linear programming scheduling framework for addressing sequence-dependent setup issues in batch plants, Industrial & Engineering Chemistry Research, 48 (2009), 6346-6357.
doi: 10.1021/ie801127t.
|
|
[22]
|
P. S. Ku and S. C. Niu, On Johnson's two-machine flow shop with random processing times, Operations Research, 34 (1986), 130-136.
doi: 10.1287/opre.34.1.130.
|
|
[23]
|
T. C. Lai, Y. N. Sotskov, N. Y. Sotskova and F. Werner, Optimal makespan scheduling with given bounds of processing times, Mathematical and Computer Modelling, 26 (1997), 67-86.
doi: 10.1016/S0895-7177(97)00132-5.
|
|
[24]
|
X. Li, Z. Yang, R. Ruiz, T. Chen and S. Sui, An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects, Information Sciences, 453 (2018), 408–425.
doi: 10.1016/j.ins.2018.04.038.
|
|
[25]
|
R. Macchiaroli, S. Molè and S. Riemma, Modelling and optimization of industrial manufacturing processes subject to no-wait constraints, Int. Journal of Production Research, 37 (1999), 2585-2607.
doi: 10.1080/002075499190671.
|
|
[26]
|
N. M. Matsveichuk, Y. N. Sotskov, N. G. Egorova and T. C. Lai, Schedule execution for two-machine flow-shop with interval processing times, Mathematical and Computer Modelling, 49 (2009), 991-1011.
doi: 10.1016/j.mcm.2008.02.004.
|
|
[27]
|
N. M. Matsveichuk, Y. N. Sotskov and F. Werner, Partial job order for solving the two-machine flow-shop minimum-length problem with uncertain processing times, Optimization, 60 (2011), 1493-1517.
doi: 10.1080/02331931003657691.
|
|
[28]
|
M. Pinedo, Stochastic scheduling with release dates and due dates, Operations Research, 31 (1983), 559-572.
doi: 10.1287/opre.31.3.559.
|
|
[29]
|
M. Pinedo, Scheduling Theory, Algorithms, and Systems, Prentice Hall, Englewood Cliffs, New Jersey, Page 349, 1995.
|
|
[30]
|
V. Portougal and D. Trietsch, Johnson's problem with stochastic processing times and optimal service level, European Journal of Operational Research, 169 (2006), 751-760.
doi: 10.1016/j.ejor.2004.09.056.
|
|
[31]
|
V. Riahi and M. Kazemi, A new hybrid ant colony algorithm for scheduling of no-wait flowshop, Operational Research, 18 (2018), 55-74.
doi: 10.1007/s12351-016-0253-x.
|
|
[32]
|
D. K. Seo, C. M. Klein and W. Jang, Single machine stochastic scheduling to minimize the expected number of tardy jobs using mathematical programming models, Computers and Industrial Engineering, 48 (2005), 153-161.
doi: 10.1016/j.cie.2005.01.002.
|
|
[33]
|
H. M. Soroush, Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs, European Journal of Operational Research, 113 (1999), 450-468.
|
|
[34]
|
H. M. Soroush, Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem., European Journal of Operational Research, 181 (2007), 266-287.
doi: 10.1016/j.ejor.2006.05.036.
|
|
[35]
|
Y. N. Sotskov and N. M. Matsveichuk, Uncertainty measure for the Bellman-Johnson problem with interval processing times, Cybernetics and System Analysis, 48 (2012), 641-652.
doi: 10.1007/s10559-012-9445-4.
|
|
[36]
|
Y. N. Sotskov, N. G. Egorova and T. C. Lai, Minimizing total weighted flow time of a set of jobs with interval processing times, Mathematical and Computer Modelling, 50 (2009), 556-573.
doi: 10.1016/j.mcm.2009.03.006.
|
|
[37]
|
Y. N. Sotskov and T. C. Lai, Minimizing total weighted flow under uncertainty using dominance and a stability box, Computers and Operations Research, 39 (2012), 1271-1289.
doi: 10.1016/j.cor.2011.02.001.
|
|
[38]
|
K. Wang and S. H. Choi, A decomposition-based approach to flexible flow shop scheduling under machine breakdown, Int. Journal of Production Research, 50 (2012), 215-234.
doi: 10.1080/00207543.2011.571456.
|
|
[39]
|
Y. Wang, X. Li, R. Ruiz and S. Sui, An iterated greedy heuristic for mixed no-wait flowshop problems, IEEE Transactions on Cybernetics, 48 (2018), 1553-1566.
doi: 10.1109/TCYB.2017.2707067.
|
|
[40]
|
K. C. Ying and S. W. Lin, Minimizing makespan for no-wait flowshop scheduling problems with setup times, Computers and Industrial Engineering, 121 (2018), 73-81.
doi: 10.1016/j.cie.2018.05.030.
|
Download:
{{journal.titleEn}} 
