Production in a two-machine flowshop scheduling environment with uncertain processing and setup times to minimize makespan

References

• Allahverdi, A. 2005. “Two-machine Flowshop Scheduling Problem to Minimize Makespan with Bounded Setup and Processing times.” International Journal of Agile Manufacturing 8: 145–153.
   Google Scholar
• Allahverdi, A. 2006a. “Two-machine Flowshop Scheduling Problem to Minimize Total Completion Time with Bounded Setup and Processing times.” International Journal of Production Economics 103: 386–400.10.1016/j.ijpe.2005.10.002
   Web of Science ®Google Scholar
• Allahverdi, A. 2006b. “Two-machine Flowshop Scheduling Problem to Minimize Maximum Lateness with Bounded Setup and Processing times.” Kuwait Journal of Science and Engineering 33: 233–251.
   Web of Science ®Google Scholar
• Allahverdi, A., T. Aldowaisan, and Y. N. Sotskov. 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.10.1155/S016117120321019X
   Google Scholar
• Allahverdi, A., and H. Aydilek. 2010a. “Heuristics for the Two-machine Flowshop Scheduling Problem to Minimise Makespan with Bounded Processing times.” International Journal of Production Research 48: 6367–6385.10.1080/00207540903321657
   Web of Science ®Google Scholar
• Allahverdi, A., and H. Aydilek. 2010b. “Heuristics for the Two-machine Flowshop Scheduling Problem to Minimize Maximum Lateness with Bounded Processing times.” Computers and Mathematics with Applications 60: 1374–1384.10.1016/j.camwa.2010.06.019
   Web of Science ®Google Scholar
• Allahverdi, A., C. T. Ng, T. C. E. Cheng, and M. Kovalyov. 2008. “A Survey of Scheduling Problems with Setup times or Costs.” European Journal of Operational Research 187: 985–1032.10.1016/j.ejor.2006.06.060
   Web of Science ®Google Scholar
• Allahverdi, A., and Y. N. Sotskov. 2003. “Two-machine Flowshop Minimum Length Scheduling Problem with Random and Bounded Processing times.” International Transactions in Operational Research 10: 65–76.10.1111/itor.2003.10.issue-1
   Google Scholar
• Aydilek, H., and A. Allahverdi. 2010. “Two-machine Flowshop Scheduling Problem with Bounded Processing times to Minimize Total Completion Time.” Computers and Mathematics with Applications 59: 684–693.10.1016/j.camwa.2009.10.025
   Web of Science ®Google Scholar
• Aydilek, H., and A. Allahverdi. 2013. “A Polynomial Time Heuristic for the Two-machine Flowshop Scheduling Problem with Setup times and Random Processing times.” Applied Mathematical Modelling 37: 7164–7173.10.1016/j.apm.2013.02.003
   Web of Science ®Google Scholar
• Aydilek, A., H. Aydilek, and A. Allahverdi. 2013. “Increasing the Profitability and Competitiveness in a Production Environment with Random and Bounded Setup times.” International Journal of Production Research 51: 106–117.10.1080/00207543.2011.652263
   Web of Science ®Google Scholar
• Braun, O., T.-C. Lai, G. Schmidt, and Yu.N. Sotskov. 2002. “Stability of Johnson’s Schedule with Respect to Limited Machine Availability.” International Journal of Production Research 40: 4381–4400.10.1080/00207540210159527
   Web of Science ®Google Scholar
• Flynn, B. B. 1987. “The Effects of Setup times on Output Capacity in Cellular Manufacturing.” International Journal of Production Research 25: 1761–1772.
   Web of Science ®Google Scholar
• Johnson, S. M. 1954. “Optimal Two-and Three-stage Production Schedules with Setup times Included.” Naval Research Logistics Quarterly 1: 61–68.10.1002/(ISSN)1931-9193
   Google Scholar
• Keshavarz, T., and N. Salmasi. 2013. “Makespan Minimisation in Flexible Flowshop Sequence-dependent Group Scheduling Problem.” International Journal of Production Research 51: 6182–6193.10.1080/00207543.2013.825055
   Web of Science ®Google Scholar
• Kim, S. C., and P. M. Bobrowski. 1997. “Scheduling Jobs with Uncertain Setup times and Sequence Dependency.” Omega 25: 437–447.10.1016/S0305-0483(97)00013-3
   Web of Science ®Google Scholar
• Kogan, K., and E. Levner. 1998. “A Polynomial Algorithm for Scheduling Small Scale Manufacturing Cells Server by Multiples Robots.” Computers & Operations Research 25: 53–62.
   Web of Science ®Google Scholar
• Kouvelis, P., and G. Yu. 1997. Robust Discrete Optimization and Its Applications. Boston, MA: Kluwer Academic.10.1007/978-1-4757-2620-6
   Google Scholar
• Lin, Y. K., and F. Y. Hsieh. 2014. “Unrelated Parallel Machine Scheduling with Setup times and Ready times.” International Journal of Production Research 52: 1200–1214.10.1080/00207543.2013.848305
   Web of Science ®Google Scholar
• Matsveichuk, N. M., Yu N Sotskov, N. G. Egorova, and T.-C. Lai. 2009. “Schedule Execution for Two-machine Flow-shop with Interval Processing times.” Mathematical and Computer Modelling 49: 991–1011.10.1016/j.mcm.2008.02.004
   Web of Science ®Google Scholar
• Matsveichuk, N. M., Y. N. Sotskov, and F. Werner. 2011. “The Dominance Digraph as a Solution to the Two-machine Flow-Shop Problem with Interval Processing times.” Optimization 60: 1493–1517.10.1080/02331931003657691
   Web of Science ®Google Scholar
• Ng, C. T., N. M. Matsveichuk, Yu N Sotskov, and T. C. E. Cheng. 2009. “Two-machine Flow-shop Minimum-length Scheduling with Interval Processing times.” Asia-Pacific Journal of Operational Research 26: 715–734.10.1142/S0217595909002432
   Web of Science ®Google Scholar
• Seidgar, H., M. Kiani, M. Abedi, and H. Fazlollahtabarb. 2014. “An Efficient Imperialist Competitive Algorithm for Scheduling in the Two-stage Assembly Flow Shop Problem.” International Journal of Production Research 52: 1240–1256.10.1080/00207543.2013.848490
   Web of Science ®Google Scholar
• Sotskov, Y. N., A. Allahverdi, and T. C. Lai. 2004. “Flowshop Scheduling Problem to Minimize Total Completion Time with Random and Bounded Processing Times.” Journal of the Operational Research Society 55: 277–286.
   Web of Science ®Google Scholar
• Sotskova, Yu N, and N. M. Matsveichuka. 2012. “Uncertainty Measure for the Bellman–Johnson Problem with Interval Processing times.” Cybernetics and Systems Analysis 48: 641–652.10.1007/s10559-012-9445-4
   Google Scholar
• Sule, D. R., and K. Y. Huang. 1983. “Sequency on Two and Three Machines with Setup, Processing and Removal times Separated.” International Journal of Production Research 21: 723–732.10.1080/00207548308942406
   Web of Science ®Google Scholar
• Wang, K., and S. H. Choi. 2012. “A Decomposition-based Approach to Flexible Flow Shop Scheduling Under Machine Breakdown.” International Journal of Production Research 50: 215–234.10.1080/00207543.2011.571456
   Web of Science ®Google Scholar
• Yoshida, T., and K. Hitomi. 1979. “Optimal Two-stage Production Scheduling with Setup times Separated.” AIIE Transactions 11: 261–263.10.1080/05695557908974469
   Web of Science ®Google Scholar