Outsourcing and scheduling for a two-machine flow shop with release times

References

• Afzalirad, M. and J. Rezaeian. 2016. “Design of High-Performing Hybrid Meta-Heuristics for Unrelated Parallel Machine Scheduling with Machine Eligibility and Precedence Constraints.” Engineering Optimization 48: 706–726. doi: 10.1080/0305215X.2015.1042475
   Web of Science ®Google Scholar
• Ahmadizar, F. 2012. “A new ant Colony Algorithm for Makespan Minimization in Permutation Flow Shops.” Computers and Industrial Engineering 63: 355–361. doi: 10.1016/j.cie.2012.03.015
   Web of Science ®Google Scholar
• Chang, Y. C., V. C. Li, and C. J. Chiang. 2014. “An ant Colony Optimization Heuristic for an Integrated Production and Distribution Scheduling Problem.” Engineering Optimization 46: 503–520. doi: 10.1080/0305215X.2013.786062
   Web of Science ®Google Scholar
• Choi, B. C. and J. Chung. 2011. “Two-machine Flow Shop Scheduling Problem with an Outsourcing Option.” European Journal of Operational Research 213: 66–72. doi: 10.1016/j.ejor.2011.03.017
   Web of Science ®Google Scholar
• Chung, D. Y., and B. C. Choi. 2013. “Outsourcing and Scheduling for tow-Machine Ordered Flow Shop Scheduling Problems.” European Journal of Operational Research 226: 46–52. doi: 10.1016/j.ejor.2012.10.048
   Web of Science ®Google Scholar
• Dorigo, M., and L. M. Gambardella. 1997. “Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem.” IEEE Transactions on Evolutionary Computation l: 53–66. doi: 10.1109/4235.585892
   Google Scholar
• Dorigo, M., and T. Stutzle. 2004. Ant Colony Optimization. Cambridge: MIT Press.
   Google Scholar
• Guo, X., and D. Lei. 2014. “Bi-objective job Shop Scheduling with Outsourcing Options.” International Journal of Production Research 52: 3832–3841. doi: 10.1080/00207543.2013.848488
   Web of Science ®Google Scholar
• Lee, K., and B. C. Choi. 2011. “Two-stage Production Scheduling with an Outsourcing Option.” European Journal of Operational Research 213: 489–497. doi: 10.1016/j.ejor.2011.03.037
   Web of Science ®Google Scholar
• Lei, D., and X. Guo. 2016. “A Shuffled Frog-Leaping Algorithm for job Shop Scheduling with Outsourcing Options.” International Journal of Production Research, in press. doi:doi: 10.1080/00207543.2015.1088970.
   PubMed Web of Science ®Google Scholar
• Lenstra, J. K., A. H. G. Rinnooy Kan, and P. Brucker. 1977. “Complexity of Machine Scheduling Problems.” Annals of Discrete Mathematics 1: 343–362. doi: 10.1016/S0167-5060(08)70743-X
   Google Scholar
• McIvor, R. 2010. “The Influence of Capability Considerations on the Outsourcing Decision: the Case of a Manufacturing Company.” International Journal of Production Research 48: 5031–5052. doi: 10.1080/00207540903049423
   Web of Science ®Google Scholar
• Mokhtari, H., and I. N. K. Abadi. 2013. “Scheduling with an Outsourcing Option on Both Manufacturer and Subcontractors.” Computers and Operations Research 40: 1234–1242. doi: 10.1016/j.cor.2012.12.003
   Web of Science ®Google Scholar
• Mokhtari, H., I. N. K. Abadi, and M. R. Amin-Naseri. 2012. “Production Scheduling with Outsourcing Scenarios: a Mixed Integer Programming and Efficient Solution Procedure.” International Journal of Production Research 50: 5372–5395. doi: 10.1080/00207543.2011.627687
   Web of Science ®Google Scholar
• Nagar, A., S. S. Heragu, and J. Haddock. 1995. “A Branch-and-Bound Approach for a two-Machine Flowshop Scheduling Problem.” Journal of the Operational Research Society 46: 721–734. doi: 10.1057/jors.1995.102
   Web of Science ®Google Scholar
• Potts, C. N. 1985. “Analysis of Heuristics for two Machine Flow-Shop Sequencing Subject to Release Dates.” Mathematics of Operations Research 10: 576–584. doi: 10.1287/moor.10.4.576
   Web of Science ®Google Scholar
• Qi, X. 2008. “Coordinated Logistics Scheduling for in-House Production and Outsourcing.” IEEE Transactions on Automation Science and Engineering 5: 188–192. doi: 10.1109/TASE.2006.887159
   Web of Science ®Google Scholar
• Qi, X. 2009. “Two-stage Production Scheduling with an Option of Outsourcing From a Remote Supplier.” Journal of System Science and System Engineering 18: 1–15. doi: 10.1007/s11518-009-5094-1
   Web of Science ®Google Scholar
• Qi, X. 2011. “Outsourcing and Production Scheduling for a two-Stage Flow Shop.” International Journal of Production Economics 129: 43–50. doi: 10.1016/j.ijpe.2010.08.011
   Web of Science ®Google Scholar
• Rossi, A. 2014. “Flexible job Shop Scheduling with Sequence-Dependent Setup and Transportation Times by ant Colony with Reinforced Pheromone Relationships.” International Journal of Production Economics 153: 253–267. doi: 10.1016/j.ijpe.2014.03.006
   Web of Science ®Google Scholar
• Tadei, R., J. N. D. Gupta, F. Della Croce, and M. Cortesi. 1998. “Minimising Makespan in the two-Machine Flow-Shop with Release Times.” Journal of the Operational Research Society 49: 77–85. doi: 10.1057/palgrave.jors.2600481
   Web of Science ®Google Scholar
• Tavares Neto, R. F., and M. Godinho Filho. 2011. “An ant Colony Optimization Approach to a Permutational Flowshop Scheduling Problem with Outsourcing Allowed.” Computers and Operations Research 38: 1286–1293. doi: 10.1016/j.cor.2010.11.010
   Web of Science ®Google Scholar
• Tavares Neto, R. F., M. Godinho Filho, and F. M. da Silva. 2015. “An ant Colony Optimization Approach for the Parallel Machine Scheduling Problem with Outsourcing Allowed.” Journal of Intelligent Manufacturing 26: 527–538. doi: 10.1007/s10845-013-0811-5
   Web of Science ®Google Scholar
• Tian, Y., D. Li, P. Zhou, and L. Wang. 2016. “Coordinated Scheduling of Intercell Production and Intercell Transportation in the Equipment Manufacturing Industry.” Engineering Optimization 48: 2046–2063. doi: 10.1080/0305215X.2016.1150470
   Web of Science ®Google Scholar
• Zhang, L., L. Lu, and S. Li. 2016. “New Results on two-Machine Flow-Shop Scheduling with Rejection.” Journal of Combinatorial Optimization 31: 1493–1504. doi: 10.1007/s10878-015-9836-3
   Web of Science ®Google Scholar
• Zhong, W., and Z. Huo. 2013. “Single Machine Scheduling Problems with Subcontracting Options.” Journal of Combinatorial Optimization 26: 489–498. doi: 10.1007/s10878-011-9442-y
   Web of Science ®Google Scholar