How to cite this paper
Allahverdi, A. (2022). A survey of scheduling problems with uncertain interval/bounded processing/setup times.Journal of Project Management, 7(4), 255-264.
Refrences
Alimian, M., Ghezavati, V., Tavakkoli-Moghaddam, R., & Ramezanian, R. (2022). Solving a parallel-line capacitated lot-sizing and scheduling problem with sequence-dependent setup time/cost and preventive maintenance by a rolling horizon method. Computers & Industrial Engineering, 108041.
Allahverdi, M. (2022a). An improved algorithm to minimize the total completion time in a two-machine no-wait flow-shop with uncertain setup times. Journal of Project Management, 7(1), 1-12.
Allahverdi, M. (2022b). A Substantially Improved New Algorithm for Flowshop Scheduling Problem with Uncertain Processing Times. International Journal of Engineering Research and Development, 14(1), 155-163.
Allahverdi, M. (2022c). Significantly improved dominance relation for no-wait flowshop scheduling problems with un-certain setup times. Revised for Hacettepe Journal of Mathematics and Statistics.
Allahverdi, M. (2021). Minimizing Makespan For Flowshop Scheduling Problem with Random and Bounded Processing Times. International Journal of Business and Technology Management, 3(2), 49-52.
Allahverdi, A. (2015). The third comprehensive survey on scheduling problems with setup times/costs. European Jour-nal of Operational Research, 246(2), 345-378.
Allahverdi, M., & Allahverdi, A. (2021a). Four-Machine Flowshop Scheduling Problem with Uncertain Processing Times to Minimize Mean Completion Time. International Journal of Business and Technology Management, 3(2), 44-48.
Allahverdi, A., & Allahverdi, M. (2021b). An Improved Algorithm for Minimizing Makespan on Flowshops with Un-certain Processing Times. International Journal of Engineering Research and Development, 13(2), 521-530.
Allahverdi, M., & Allahverdi, A. (2021c). Minimizing total completion time for flowshop scheduling problem with un-certain processing times. RAIRO: Operations Research, 55, 929.
Allahverdi, M., & Allahverdi, A. (2021d). Four-machine flowshop scheduling problem with uncertain processing times to minimize mean completion time. In Proc. of International E-Conference on Applied Sciences, Society, and Eco-nomics, Kuala Lumpur, Malaysia, (pp. 30-34).
Allahverdi, M., Aydilek, H., Aydilek, A., & Allahverdi, A. (2021). A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure. Journal of Industrial & Management Op-timization, 17(4), 1973-1991.
Allahverdi, M., & Allahverdi, A. (2020a). Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times. Journal of Industrial & Management Optimization, 16(5), 2439.
Allahverdi, M., & Allahverdi, A. (2020b). Algorithms for four-machine flowshop scheduling problem with uncertain processing times to minimize makespan. RAIRO-Operations Research, 54(2), 529-553.
Allahverdi, A., & Allahverdi, M. (2018a). Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness. Computational and Applied Mathematics, 37(5), 6774-6794.
Allahverdi, M., & Allahverdi, A. (2018b). Minimizing mean completion time for a two-machine no-wait flowshop scheduling problem. In Proc. of the International Conference on Contemporary Issues in Business & Economics, To-kat, Turkey, (pp. 270-274).
Allahverdi, A., & Allahverdi, M. (2018c). The two-machine no-wait flowshop problem with uncertain setup times. In Proc. of the International Conference on Contemporary Issues in Business & Economics, Tokat, Turkey, (pp. 35-38).
Allahverdi, M., & Allahverdi, A. (2018d). Minimizing makespan in flowshops with bounded processing times. In Proc. of the VI. International GAP Engineering Conference, Sanliurfa, Turkey, (pp. 13-16).
Allahverdi, M., & Allahverdi, A. (2018e). Minimizing mean completion time for bounded processing times in flow-shops. In Proc. of the VI. International GAP Engineering Conference, Sanliurfa, Turkey, (pp. 17-20).
Allahverdi, A., Aydilek, H., & Aydilek, A. (2014). Single machine scheduling problem with interval processing times to minimize mean weighted completion time. Computers & Operations Research, 51, 200-207.
Allahverdi, A., & Aydilek, H. (2010a). Heuristics for the two-machine flowshop scheduling problem to minimize maxi-mum lateness with bounded processing times. Computers & Mathematics with Applications, 60(5), 1374-1384.
Allahverdi, A., & Aydilek, H. (2010b). Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times. International Journal of Production Research, 48(21), 6367-6385.
Allahverdi, A., (2009). Three-machine flowshop scheduling problem to minimize maximum lateness with bounded setup and processing times. Journal of Operations and Logistics, 2(1), 1-11.
Allahverdi, A. (2008). Three-machine flowshop scheduling problem to minimize makespan with bounded setup and pro-cessing times. Journal of the Chinese Institute of Industrial Engineers, 25(1), 52-61.
Allahverdi, A. (2007). Three-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times. Decision making in manufacturing and services, 1(1-2), 5-23.
Allahverdi, A. (2006a). Two-machine flowshop scheduling problem to minimize maximum lateness with bounded setup and processing times. Kuwait Journal of Science and Engineering, 33(2), 233.
Allahverdi, A. (2006b). Two-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times. International Journal of Production Economics, 103(1), 386-400.
Allahverdi, A. (2005). Two-machine flowshop scheduling problem to minimize makespan with bounded setup and pro-cessing times. International Journal of Agile Manufacturing, 8, 145-153.
Allahverdi, A., Aldowaisan, T., & Sotskov, Y. N. (2003). Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times. International Journal of Mathematics and Mathematical Sciences, 39, 2475-2486.
Allahverdi, A., & Sotskov, Y. (2003). Two–machine flowshop minimum–length scheduling problem with random and bounded processing times. International Transactions in Operational Research, 10(1), 65-76.
Allali, K., Aqil, S., & Belabid, J. (2022). Distributed no-wait flow shop problem with sequence dependent setup time: Optimization of makespan and maximum tardiness. Simulation Modelling Practice and Theory, 116, 102455.
An, Y. J., Kim, Y. D., & Choi, S. W. (2016). Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times. Computers & Operations Research, 71, 127-136.
Aydilek, H., Aydilek, A., Allahverdi, M., & Allahverdi, A., (2022). More effective heuristics for a two-machine no-wait flowshop to minimize maximum lateness. Submitted.
Aydilek, H., Aydilek, A., & Allahverdi, A. (2021). Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times. Engineering Optimization, 53(8), 1417-1430.
Aydilek, A., Aydilek, H., & Allahverdi, A. (2017). Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times. Applied mathematical modelling, 45, 982-996.
Aydilek, A., Aydilek, H., & Allahverdi, A. (2015). Production in a two-machine flowshop scheduling environment with uncertain processing and setup times to minimize makespan. International Journal of Production Research, 53(9), 2803-2819.
Aydilek, H., & Allahverdi, A. (2013). A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times. Applied Mathematical Modelling, 37(12-13), 7164-7173.
Aydilek, A., Aydilek, H., & Allahverdi, A. (2013). Increasing the profitability and competitiveness in a production envi-ronment with random and bounded setup times. International Journal of Production Research, 51(1), 106-117.
Aydilek, H., & Allahverdi, A. (2010). Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time. Computers & mathematics with applications, 59(2), 684-693.
Behnamian, J. (2016). Survey on fuzzy shop scheduling. Fuzzy Optimization and Decision Making, 15(3), 331-366.
Díaz, H., Palacios, J. J., Díaz, I., Vela, C. R., & González-Rodríguez, I. (2022). Robust schedules for tardiness optimiza-tion in job shop with interval uncertainty. Logic Journal of the IGPL, In Press.
Drwal, M., & Józefczyk, J. (2020). Robust min–max regret scheduling to minimize the weighted number of late jobs with interval processing times. Annals of Operations Research, 284(1), 263-282.
Drwal, M. (2018). Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty. Computers & Operations Research, 91, 13-20.
Drwal, M. (2017, September). Min-max regret scheduling to minimize the total weight of late jobs with interval uncer-tainty. In International conference on optimization and decision science (pp. 611-619). Springer, Cham.
Drwal, M., & Rischke, R. (2016). Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion. Operations Research Letters, 44(3), 354-358.
Gelogullari, C. A., & Logendran, R. (2010). Group-scheduling problems in electronics manufacturing. Journal of sched-uling, 13(2), 177-202.
Gonzalez-Neira, E. M., Ferone, D., Hatami, S., & Juan, A. A. (2017a). A biased-randomized simheuristic for the distrib-uted assembly permutation flowshop problem with stochastic processing times. Simulation Modelling Practice and Theory, 79, 23-36.
González-Neira, E., Montoya-Torres, J., & Barrera, D. (2017b). Flow-shop scheduling problem under uncertainties: Re-view and trends. International Journal of Industrial Engineering Computations, 8(4), 399-426.
Honkomp, S. J., Mockus, L., & Reklaitis, G. V. (1997). Robust scheduling with processing time uncertainty. Computers & Chemical Engineering, 21, S1055-S1060.
Keshavarz, T., & Salmasi, N. (2013). Makespan minimisation in flexible flowshop sequence-dependent group schedul-ing problem. International Journal of Production Research, 51(20), 6182-6193.
Kouvelis, P., & Yu, G. (2013). Robust discrete optimization and its applications (Vol. 14). Springer Science & Business Media.
Kopanos, G. M., Laínez, J. M., & Puigjaner, L. (2009). An efficient mixed-integer linear programming scheduling framework for addressing sequence-dependent setup issues in batch plants. Industrial & Engineering Chemistry Re-search, 48(13), 6346-6357.
Lai, T. C., Sotskov, Y. N., Egorova, N. G., & Werner, F. (2018). The optimality box in uncertain data for minimising the sum of the weighted job completion times. International Journal of Production Research, 56(19), 6336-6362.
Lai, T. C., Sotskov, Y. N., Sotskova, N., & Werner, F. (2004). Mean flow time minimization with given bounds of pro-cessing times. European Journal of Operational Research, 159(3), 558-573.
Lai, T. C., Sotskov, Y. N., Sotskova, N. Y., & Werner, F. (1997). Optimal makespan scheduling with given bounds of processing times. Mathematical and Computer Modelling, 26(3), 67-86.
Leshchenko, N., & Sotskov, Y. (2007). Realization of an optimal schedule for the two-machine flow-shop with interval job processing times. International Journal Information Theories and Applications, 14, 182–189.
Leshchenko, N., & Sotskov, Y. (2006). A dominant schedule for the uncertain two-machine shop-scheduling problem. In Proc. of XII International Conference «Knowledge-Dialogue-Solution».–Varna, Bulgaria (pp. 291-297).
Leshchenko, N., & Sotskov, Y. (2005). Two-machine minimum-length shop-scheduling problems with uncertain pro-cessing times. In Proceedings of XI-th International Conference” Knowledge-Dialogue-Solution” (pp. 375-381).
Loveland, J. L., Monkman, S. K., & Morrice, D. J. (2007). Dell uses a new production-scheduling algorithm to accom-modate increased product variety. Interfaces, 37(3), 209-219.
Mara, S. T. W., Sutoyo, E., Norcahyo, R., & Rifai, A. P. (2021). The job sequencing and tool switching problem with se-quence-dependent setup time. Journal of King Saud University-Engineering Sciences, In Press.
Matsveichuk, N. M., Sotskov, Y. N., Egorova, N. G., & Lai, T. C. (2009a). Schedule execution for two-machine flow-shop with interval processing times. Mathematical and Computer Modelling, 49(5-6), 991-1011.
Matsveichuk, N. M., Sotskov, Y. N., & Werner, F. (2009b). Partial job order for solving the two-machine flow-shop min-imum-length problem with uncertain processing times. IFAC Proceedings Volumes, 42(4), 1517-1522.
Min, B., & Kim, C. O. (2022). State-Dependent Parameter Tuning of the Apparent Tardiness Cost Dispatching Rule Us-ing Deep Reinforcement Learning. IEEE Access, 10, 20187-20198.
Ng, C. T., Matsveichuk, N. M., Sotskov, Y. N., & Cheng, T. E. (2009). Two-machine flow-shop minimum-length sched-uling with interval processing times. Asia-Pacific Journal of Operational Research, 26(06), 715-734.
Pereira, J. (2016). The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective. Computers & Operations Research, 66, 141-152.
Pessoa, A. A., Bulhões, T., Nesello, V., & Subramanian, A. (2022). Exact approaches for single machine total weighted tardiness batch scheduling. INFORMS Journal on Computing, In Press.
Rifai, A. P., Mara, S. T. W., & Sudiarso, A. (2021). Multi-objective distributed reentrant permutation flow shop schedul-ing with sequence-dependent setup time. Expert Systems with Applications, 183, 115339.
Sabouni, M. Y., & Logendran, R. (2013a). Carryover sequence-dependent group scheduling with the integration of inter-nal and external setup times. European Journal of Operational Research, 224(1), 8-22.
Sabouni, M. Y., & Logendran, R. (2013b). A single machine carryover sequence-dependent group scheduling in PCB manufacturing. Computers & operations research, 40(1), 236-247.
Seidgar, H., Kiani, M., Abedi, M., & Fazlollahtabar, H. (2014). An efficient imperialist competitive algorithm for scheduling in the two-stage assembly flow shop problem. International Journal of Production Research, 52(4), 1240-1256.
Siepak, M., & Józefczyk, J. (2014). Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion. Annals of Operations Research, 222(1), 517-533.
Sotskov, Y. N., Matsveichuk, N. M., & Hatsura, V. D. (2020). Schedule execution for two-machine job-shop to minimize makespan with uncertain processing times. Mathematics, 8(8), 1314.
Sotskov, Y. N., & Egorova, N. G. (2019). The optimality region for a single-machine scheduling problem with bounded durations of the jobs and the total completion time objective. Mathematics, 7(5), 382.
Sotskov, Y. N., Matsveichuk, N. M., & Hatsura, V. D. (2019a). Two-machine job-shop scheduling problem to minimize the makespan with uncertain job durations. Algorithms, 13(1), 4.
Sotskov, Y. N., Egorova, N. G., & Werner, F. (2019b). The Optimality Box and Region for Single-Machine Scheduling of a Set of Jobs with Uncertain Durations. IFAC-PapersOnLine, 52(13), 88-93.
Sotskov, Y. N., & Egorova, N. G. (2018). Single machine scheduling problem with interval processing times and total completion time objective. Algorithms, 11(5), 66.
Sotskov, Y. N., Matsveichuk, N. M., Kasiankou, A. A., & Werner, F. (2014). Time Management Based on Two-Machine Flowshop Scheduling With Uncertain Job Processing Times. International Journal of Information Technologies Knowledge, 8(3), 212-224.
Sotskov, Y. N., Lai, T. C., & Werner, F. (2013). Measures of problem uncertainty for scheduling with interval processing times. OR spectrum, 35(3), 659-689.
Sotskov, Y. N., & Lai, T. C. (2012). Minimizing total weighted flow time under uncertainty using dominance and a sta-bility box. Computers & Operations Research, 39(6), 1271-1289.
Sotskov, Y. N., Egorova, N. G., & Werner, F. (2010). Minimizing total weighted completion time with uncertain data: A stability approach. Automation and Remote Control, 71(10), 2038-2057.
Sotskov, Y. N., Egorova, N. G., & Lai, T. C. (2009). Minimizing total weighted flow time of a set of jobs with interval processing times. Mathematical and Computer Modelling, 50(3-4), 556-573.
Sotskov, Y.N., & Egorova, N.G., (2008). Sequencing jobs with uncertain processing times and minimizing the weighted total flow time. In Proc. of XIV-th International Conference Knowledge-Dialogue-Solution, June-July, Varna (Bul-garia), (pp. 375-381).
Sotskov, Y. N., Allahverdi, A., & Lai, T. C. (2004). Flowshop scheduling problem to minimize total completion time with random and bounded processing times. Journal of the Operational Research Society, 55(3), 277-286.
Tayanithi, P., Manivannan, S., & Banks, J. (1992). A knowledge-based simulation architecture to analyze interruptions in a flexible manufacturing system. Journal of manufacturing systems, 11(3), 195-214.
Trovinger, S. C., & Bohn, R. E. (2005). Setup time reduction for electronics assembly: Combining simple (SMED) and IT‐based methods. Production and operations management, 14(2), 205-217.
Wang, K., & Choi, S. H. (2012). A decomposition-based approach to flexible flow shop scheduling under machine breakdown. International Journal of Production Research, 50(1), 215-234.
Xie, N., & Chen, N. (2018). Flexible job shop scheduling problem with interval grey processing time. Applied Soft Com-puting, 70, 513-524.
Xu, X., Lin, J., & Cui, W. (2014). Hedge against total flow time uncertainty of the uniform parallel machine scheduling problem with interval data. International Journal of Production Research, 52(19), 5611-5625.
Xu, X., Cui, W., Lin, J., & Qian, Y. (2013). Robust makespan minimisation in identical parallel machine scheduling problem with interval data. International Journal of Production Research, 51(12), 3532-3548.
Yamada, T., Nagano, M., & Miyata, H. (2021). Minimization of total tardiness in no-wait flowshop production systems with preventive maintenance. International Journal of Industrial Engineering Computations, 12(4), 415-426.
Ying, K. C. (2015). Scheduling the two-machine flowshop to hedge against processing time uncertainty. Journal of the Operational Research Society, 66(9), 1413-1425.
Ying, K. C., & Lin, S. W. (2018). Minimizing makespan for the distributed hybrid flowshop scheduling problem with multiprocessor tasks. Expert systems with applications, 92, 132-141.
Zhu, Z., & Zhou, X. (2020). Flexible job-shop scheduling problem with job precedence constraints and interval grey pro-cessing time. Computers & Industrial Engineering, 149, 106781.
Allahverdi, M. (2022a). An improved algorithm to minimize the total completion time in a two-machine no-wait flow-shop with uncertain setup times. Journal of Project Management, 7(1), 1-12.
Allahverdi, M. (2022b). A Substantially Improved New Algorithm for Flowshop Scheduling Problem with Uncertain Processing Times. International Journal of Engineering Research and Development, 14(1), 155-163.
Allahverdi, M. (2022c). Significantly improved dominance relation for no-wait flowshop scheduling problems with un-certain setup times. Revised for Hacettepe Journal of Mathematics and Statistics.
Allahverdi, M. (2021). Minimizing Makespan For Flowshop Scheduling Problem with Random and Bounded Processing Times. International Journal of Business and Technology Management, 3(2), 49-52.
Allahverdi, A. (2015). The third comprehensive survey on scheduling problems with setup times/costs. European Jour-nal of Operational Research, 246(2), 345-378.
Allahverdi, M., & Allahverdi, A. (2021a). Four-Machine Flowshop Scheduling Problem with Uncertain Processing Times to Minimize Mean Completion Time. International Journal of Business and Technology Management, 3(2), 44-48.
Allahverdi, A., & Allahverdi, M. (2021b). An Improved Algorithm for Minimizing Makespan on Flowshops with Un-certain Processing Times. International Journal of Engineering Research and Development, 13(2), 521-530.
Allahverdi, M., & Allahverdi, A. (2021c). Minimizing total completion time for flowshop scheduling problem with un-certain processing times. RAIRO: Operations Research, 55, 929.
Allahverdi, M., & Allahverdi, A. (2021d). Four-machine flowshop scheduling problem with uncertain processing times to minimize mean completion time. In Proc. of International E-Conference on Applied Sciences, Society, and Eco-nomics, Kuala Lumpur, Malaysia, (pp. 30-34).
Allahverdi, M., Aydilek, H., Aydilek, A., & Allahverdi, A. (2021). A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure. Journal of Industrial & Management Op-timization, 17(4), 1973-1991.
Allahverdi, M., & Allahverdi, A. (2020a). Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times. Journal of Industrial & Management Optimization, 16(5), 2439.
Allahverdi, M., & Allahverdi, A. (2020b). Algorithms for four-machine flowshop scheduling problem with uncertain processing times to minimize makespan. RAIRO-Operations Research, 54(2), 529-553.
Allahverdi, A., & Allahverdi, M. (2018a). Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness. Computational and Applied Mathematics, 37(5), 6774-6794.
Allahverdi, M., & Allahverdi, A. (2018b). Minimizing mean completion time for a two-machine no-wait flowshop scheduling problem. In Proc. of the International Conference on Contemporary Issues in Business & Economics, To-kat, Turkey, (pp. 270-274).
Allahverdi, A., & Allahverdi, M. (2018c). The two-machine no-wait flowshop problem with uncertain setup times. In Proc. of the International Conference on Contemporary Issues in Business & Economics, Tokat, Turkey, (pp. 35-38).
Allahverdi, M., & Allahverdi, A. (2018d). Minimizing makespan in flowshops with bounded processing times. In Proc. of the VI. International GAP Engineering Conference, Sanliurfa, Turkey, (pp. 13-16).
Allahverdi, M., & Allahverdi, A. (2018e). Minimizing mean completion time for bounded processing times in flow-shops. In Proc. of the VI. International GAP Engineering Conference, Sanliurfa, Turkey, (pp. 17-20).
Allahverdi, A., Aydilek, H., & Aydilek, A. (2014). Single machine scheduling problem with interval processing times to minimize mean weighted completion time. Computers & Operations Research, 51, 200-207.
Allahverdi, A., & Aydilek, H. (2010a). Heuristics for the two-machine flowshop scheduling problem to minimize maxi-mum lateness with bounded processing times. Computers & Mathematics with Applications, 60(5), 1374-1384.
Allahverdi, A., & Aydilek, H. (2010b). Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times. International Journal of Production Research, 48(21), 6367-6385.
Allahverdi, A., (2009). Three-machine flowshop scheduling problem to minimize maximum lateness with bounded setup and processing times. Journal of Operations and Logistics, 2(1), 1-11.
Allahverdi, A. (2008). Three-machine flowshop scheduling problem to minimize makespan with bounded setup and pro-cessing times. Journal of the Chinese Institute of Industrial Engineers, 25(1), 52-61.
Allahverdi, A. (2007). Three-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times. Decision making in manufacturing and services, 1(1-2), 5-23.
Allahverdi, A. (2006a). Two-machine flowshop scheduling problem to minimize maximum lateness with bounded setup and processing times. Kuwait Journal of Science and Engineering, 33(2), 233.
Allahverdi, A. (2006b). Two-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times. International Journal of Production Economics, 103(1), 386-400.
Allahverdi, A. (2005). Two-machine flowshop scheduling problem to minimize makespan with bounded setup and pro-cessing times. International Journal of Agile Manufacturing, 8, 145-153.
Allahverdi, A., Aldowaisan, T., & Sotskov, Y. N. (2003). Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times. International Journal of Mathematics and Mathematical Sciences, 39, 2475-2486.
Allahverdi, A., & Sotskov, Y. (2003). Two–machine flowshop minimum–length scheduling problem with random and bounded processing times. International Transactions in Operational Research, 10(1), 65-76.
Allali, K., Aqil, S., & Belabid, J. (2022). Distributed no-wait flow shop problem with sequence dependent setup time: Optimization of makespan and maximum tardiness. Simulation Modelling Practice and Theory, 116, 102455.
An, Y. J., Kim, Y. D., & Choi, S. W. (2016). Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times. Computers & Operations Research, 71, 127-136.
Aydilek, H., Aydilek, A., Allahverdi, M., & Allahverdi, A., (2022). More effective heuristics for a two-machine no-wait flowshop to minimize maximum lateness. Submitted.
Aydilek, H., Aydilek, A., & Allahverdi, A. (2021). Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times. Engineering Optimization, 53(8), 1417-1430.
Aydilek, A., Aydilek, H., & Allahverdi, A. (2017). Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times. Applied mathematical modelling, 45, 982-996.
Aydilek, A., Aydilek, H., & Allahverdi, A. (2015). Production in a two-machine flowshop scheduling environment with uncertain processing and setup times to minimize makespan. International Journal of Production Research, 53(9), 2803-2819.
Aydilek, H., & Allahverdi, A. (2013). A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times. Applied Mathematical Modelling, 37(12-13), 7164-7173.
Aydilek, A., Aydilek, H., & Allahverdi, A. (2013). Increasing the profitability and competitiveness in a production envi-ronment with random and bounded setup times. International Journal of Production Research, 51(1), 106-117.
Aydilek, H., & Allahverdi, A. (2010). Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time. Computers & mathematics with applications, 59(2), 684-693.
Behnamian, J. (2016). Survey on fuzzy shop scheduling. Fuzzy Optimization and Decision Making, 15(3), 331-366.
Díaz, H., Palacios, J. J., Díaz, I., Vela, C. R., & González-Rodríguez, I. (2022). Robust schedules for tardiness optimiza-tion in job shop with interval uncertainty. Logic Journal of the IGPL, In Press.
Drwal, M., & Józefczyk, J. (2020). Robust min–max regret scheduling to minimize the weighted number of late jobs with interval processing times. Annals of Operations Research, 284(1), 263-282.
Drwal, M. (2018). Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty. Computers & Operations Research, 91, 13-20.
Drwal, M. (2017, September). Min-max regret scheduling to minimize the total weight of late jobs with interval uncer-tainty. In International conference on optimization and decision science (pp. 611-619). Springer, Cham.
Drwal, M., & Rischke, R. (2016). Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion. Operations Research Letters, 44(3), 354-358.
Gelogullari, C. A., & Logendran, R. (2010). Group-scheduling problems in electronics manufacturing. Journal of sched-uling, 13(2), 177-202.
Gonzalez-Neira, E. M., Ferone, D., Hatami, S., & Juan, A. A. (2017a). A biased-randomized simheuristic for the distrib-uted assembly permutation flowshop problem with stochastic processing times. Simulation Modelling Practice and Theory, 79, 23-36.
González-Neira, E., Montoya-Torres, J., & Barrera, D. (2017b). Flow-shop scheduling problem under uncertainties: Re-view and trends. International Journal of Industrial Engineering Computations, 8(4), 399-426.
Honkomp, S. J., Mockus, L., & Reklaitis, G. V. (1997). Robust scheduling with processing time uncertainty. Computers & Chemical Engineering, 21, S1055-S1060.
Keshavarz, T., & Salmasi, N. (2013). Makespan minimisation in flexible flowshop sequence-dependent group schedul-ing problem. International Journal of Production Research, 51(20), 6182-6193.
Kouvelis, P., & Yu, G. (2013). Robust discrete optimization and its applications (Vol. 14). Springer Science & Business Media.
Kopanos, G. M., Laínez, J. M., & Puigjaner, L. (2009). An efficient mixed-integer linear programming scheduling framework for addressing sequence-dependent setup issues in batch plants. Industrial & Engineering Chemistry Re-search, 48(13), 6346-6357.
Lai, T. C., Sotskov, Y. N., Egorova, N. G., & Werner, F. (2018). The optimality box in uncertain data for minimising the sum of the weighted job completion times. International Journal of Production Research, 56(19), 6336-6362.
Lai, T. C., Sotskov, Y. N., Sotskova, N., & Werner, F. (2004). Mean flow time minimization with given bounds of pro-cessing times. European Journal of Operational Research, 159(3), 558-573.
Lai, T. C., Sotskov, Y. N., Sotskova, N. Y., & Werner, F. (1997). Optimal makespan scheduling with given bounds of processing times. Mathematical and Computer Modelling, 26(3), 67-86.
Leshchenko, N., & Sotskov, Y. (2007). Realization of an optimal schedule for the two-machine flow-shop with interval job processing times. International Journal Information Theories and Applications, 14, 182–189.
Leshchenko, N., & Sotskov, Y. (2006). A dominant schedule for the uncertain two-machine shop-scheduling problem. In Proc. of XII International Conference «Knowledge-Dialogue-Solution».–Varna, Bulgaria (pp. 291-297).
Leshchenko, N., & Sotskov, Y. (2005). Two-machine minimum-length shop-scheduling problems with uncertain pro-cessing times. In Proceedings of XI-th International Conference” Knowledge-Dialogue-Solution” (pp. 375-381).
Loveland, J. L., Monkman, S. K., & Morrice, D. J. (2007). Dell uses a new production-scheduling algorithm to accom-modate increased product variety. Interfaces, 37(3), 209-219.
Mara, S. T. W., Sutoyo, E., Norcahyo, R., & Rifai, A. P. (2021). The job sequencing and tool switching problem with se-quence-dependent setup time. Journal of King Saud University-Engineering Sciences, In Press.
Matsveichuk, N. M., Sotskov, Y. N., Egorova, N. G., & Lai, T. C. (2009a). Schedule execution for two-machine flow-shop with interval processing times. Mathematical and Computer Modelling, 49(5-6), 991-1011.
Matsveichuk, N. M., Sotskov, Y. N., & Werner, F. (2009b). Partial job order for solving the two-machine flow-shop min-imum-length problem with uncertain processing times. IFAC Proceedings Volumes, 42(4), 1517-1522.
Min, B., & Kim, C. O. (2022). State-Dependent Parameter Tuning of the Apparent Tardiness Cost Dispatching Rule Us-ing Deep Reinforcement Learning. IEEE Access, 10, 20187-20198.
Ng, C. T., Matsveichuk, N. M., Sotskov, Y. N., & Cheng, T. E. (2009). Two-machine flow-shop minimum-length sched-uling with interval processing times. Asia-Pacific Journal of Operational Research, 26(06), 715-734.
Pereira, J. (2016). The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective. Computers & Operations Research, 66, 141-152.
Pessoa, A. A., Bulhões, T., Nesello, V., & Subramanian, A. (2022). Exact approaches for single machine total weighted tardiness batch scheduling. INFORMS Journal on Computing, In Press.
Rifai, A. P., Mara, S. T. W., & Sudiarso, A. (2021). Multi-objective distributed reentrant permutation flow shop schedul-ing with sequence-dependent setup time. Expert Systems with Applications, 183, 115339.
Sabouni, M. Y., & Logendran, R. (2013a). Carryover sequence-dependent group scheduling with the integration of inter-nal and external setup times. European Journal of Operational Research, 224(1), 8-22.
Sabouni, M. Y., & Logendran, R. (2013b). A single machine carryover sequence-dependent group scheduling in PCB manufacturing. Computers & operations research, 40(1), 236-247.
Seidgar, H., Kiani, M., Abedi, M., & Fazlollahtabar, H. (2014). An efficient imperialist competitive algorithm for scheduling in the two-stage assembly flow shop problem. International Journal of Production Research, 52(4), 1240-1256.
Siepak, M., & Józefczyk, J. (2014). Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion. Annals of Operations Research, 222(1), 517-533.
Sotskov, Y. N., Matsveichuk, N. M., & Hatsura, V. D. (2020). Schedule execution for two-machine job-shop to minimize makespan with uncertain processing times. Mathematics, 8(8), 1314.
Sotskov, Y. N., & Egorova, N. G. (2019). The optimality region for a single-machine scheduling problem with bounded durations of the jobs and the total completion time objective. Mathematics, 7(5), 382.
Sotskov, Y. N., Matsveichuk, N. M., & Hatsura, V. D. (2019a). Two-machine job-shop scheduling problem to minimize the makespan with uncertain job durations. Algorithms, 13(1), 4.
Sotskov, Y. N., Egorova, N. G., & Werner, F. (2019b). The Optimality Box and Region for Single-Machine Scheduling of a Set of Jobs with Uncertain Durations. IFAC-PapersOnLine, 52(13), 88-93.
Sotskov, Y. N., & Egorova, N. G. (2018). Single machine scheduling problem with interval processing times and total completion time objective. Algorithms, 11(5), 66.
Sotskov, Y. N., Matsveichuk, N. M., Kasiankou, A. A., & Werner, F. (2014). Time Management Based on Two-Machine Flowshop Scheduling With Uncertain Job Processing Times. International Journal of Information Technologies Knowledge, 8(3), 212-224.
Sotskov, Y. N., Lai, T. C., & Werner, F. (2013). Measures of problem uncertainty for scheduling with interval processing times. OR spectrum, 35(3), 659-689.
Sotskov, Y. N., & Lai, T. C. (2012). Minimizing total weighted flow time under uncertainty using dominance and a sta-bility box. Computers & Operations Research, 39(6), 1271-1289.
Sotskov, Y. N., Egorova, N. G., & Werner, F. (2010). Minimizing total weighted completion time with uncertain data: A stability approach. Automation and Remote Control, 71(10), 2038-2057.
Sotskov, Y. N., Egorova, N. G., & Lai, T. C. (2009). Minimizing total weighted flow time of a set of jobs with interval processing times. Mathematical and Computer Modelling, 50(3-4), 556-573.
Sotskov, Y.N., & Egorova, N.G., (2008). Sequencing jobs with uncertain processing times and minimizing the weighted total flow time. In Proc. of XIV-th International Conference Knowledge-Dialogue-Solution, June-July, Varna (Bul-garia), (pp. 375-381).
Sotskov, Y. N., Allahverdi, A., & Lai, T. C. (2004). Flowshop scheduling problem to minimize total completion time with random and bounded processing times. Journal of the Operational Research Society, 55(3), 277-286.
Tayanithi, P., Manivannan, S., & Banks, J. (1992). A knowledge-based simulation architecture to analyze interruptions in a flexible manufacturing system. Journal of manufacturing systems, 11(3), 195-214.
Trovinger, S. C., & Bohn, R. E. (2005). Setup time reduction for electronics assembly: Combining simple (SMED) and IT‐based methods. Production and operations management, 14(2), 205-217.
Wang, K., & Choi, S. H. (2012). A decomposition-based approach to flexible flow shop scheduling under machine breakdown. International Journal of Production Research, 50(1), 215-234.
Xie, N., & Chen, N. (2018). Flexible job shop scheduling problem with interval grey processing time. Applied Soft Com-puting, 70, 513-524.
Xu, X., Lin, J., & Cui, W. (2014). Hedge against total flow time uncertainty of the uniform parallel machine scheduling problem with interval data. International Journal of Production Research, 52(19), 5611-5625.
Xu, X., Cui, W., Lin, J., & Qian, Y. (2013). Robust makespan minimisation in identical parallel machine scheduling problem with interval data. International Journal of Production Research, 51(12), 3532-3548.
Yamada, T., Nagano, M., & Miyata, H. (2021). Minimization of total tardiness in no-wait flowshop production systems with preventive maintenance. International Journal of Industrial Engineering Computations, 12(4), 415-426.
Ying, K. C. (2015). Scheduling the two-machine flowshop to hedge against processing time uncertainty. Journal of the Operational Research Society, 66(9), 1413-1425.
Ying, K. C., & Lin, S. W. (2018). Minimizing makespan for the distributed hybrid flowshop scheduling problem with multiprocessor tasks. Expert systems with applications, 92, 132-141.
Zhu, Z., & Zhou, X. (2020). Flexible job-shop scheduling problem with job precedence constraints and interval grey pro-cessing time. Computers & Industrial Engineering, 149, 106781.