How to cite this paper
Mazdeh, M., Heydari, M & Karamouzian, A. (2016). An integrated model of scheduling, batch delivery and supplier selection in a make-to-order manufacturing system.Decision Science Letters , 5(2), 189-200.
Refrences
Adamu, M. O., & Adewumi, A. O. (2014). A survey of single machine scheduling to minimize weighted number of tardy jobs. Journal of Industrial & Management Optimization, 10(1), 219-241.
Ahmadizar, F., & Farhadi, S. (2015). Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs. Computers & Operations Research, 53, 194-205.
Chen, Z. L. (2010). Integrated production and outbound distribution scheduling: Review and extensions. Operations Research, 58(1), 130-148.
Chen, Z. L., & Vairaktarakis, G. L. (2005). Integrated scheduling of production and distribution operations. Management Science, 51(4), 614-628.
Cheng, T. C. E., Gordon, V. S., & Kovalyov, M. Y. (1996). Single machine scheduling with batch deliveries. European Journal of Operational Research, 94(2), 277-283.
Cheng, T. C. E., & Kahlbacher, H. G. (1993). Scheduling with delivery and earliness penalties. Asia-Pacific Journal of Operational Research, 10, 145-152.
Dauzère-Pérès, S. (1995). Minimizing late jobs in the general one machine scheduling problem. European Journal of Operational Research, 81(1), 134-142.
Detienne, B. (2014). A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints. European Journal of Operational Research, 235(3), 540-552.
Graham, e. a. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5(1), 287-326.
Haddad, H., Ghanbari, P., & Moghaddam, A. Z. (2012). A new mathematical model for single machine batch schedd{stroke}uling problem for minimizing maximum lateness with deteriorating jobs. International Journal of Industrial Engineering Computations, 3(2), 253-264.
Hall, N. G., & Potts, C. N. (2003). Supply chain scheduling: Batching and delivery. Operations Research, 51(4), 566-584+674.
Herrmann, J., & Ullrich, C. A. (2013). The cost-cutting potential of supply chain scheduling. SSRN: 1829138.
Ji, M., He, Y., & Cheng, T. C. E. (2007). Batch delivery scheduling with batch delivery cost on a single machine. European Journal of Operational Research, 176(2), 745-755.
Lee, C. Y., & Chen, Z. L. (2001). Machine scheduling with transportation considerations. Journal of Scheduling, 4(1), 3-24.
Lenstra, J. K., Rinnooy Kan, A. H. G., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 7, 343–362.
Li, C.-L. (2015). Improved algorithms for single-machine common due window assignment and scheduling with batch deliveries. Theoretical Computer Science, 570, 30-39.
Mazdeh, M. M., Esfahani, A. N., Sakkaki, S. E., & Pilerood, A. E. (2012). Single-machine batch scheduling minimizing weighted flow times and delivery costs with job release times. International Journal of Industrial Engineering Computations, 3(3), 347-364.
Mazdeh, M. M., Hamidinia, A., & Karamouzian, A. (2011). A mathematical model for weighted tardy jobs scheduling problem with a batched delivery system. International Journal of Industrial Engineering Computations, 2(3), 491-498.
Mazdeh, M. M., & Karamouzian, A. (2014). Evaluating strategic issues in supply chain scheduling using game theory. International Journal of Production Research, 1-14.
Mazdeh, M. M., Sarhadi, M., & Hindi, K. S. (2007). A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs. European Journal of Operational Research, 183(1), 74-86.
Mazdeh, M. M., Sarhadi, M., & Hindi, K. S. (2008). A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times. Computers and Operations Research, 35(4), 1099-1111.
Moore, J. M. (1968). An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs. Management Science, 15(1), 102-109.
Parhizkari, M., Amirib, M., & Mousakhani, M. (2013). A multiple criteria decision making technique for supplier selection and inventory management strategy: A case of multi-product and multi-supplier problem. Decision Science Letters, 2(3), 185-190.
Pundoor, G., & Chen, Z. L. (2005). Scheduling a production-distribution system to optimize the tradeoff between delivery tardiness and distribution cost. Naval Research Logistics, 52(6), 571-589.
Rasti-Barzoki, M., Hejazi, S. R., & Mazdeh, M. M. (2013). A Branch and Bound Algorithm to Minimize the Total Weighed Number of Tardy Jobs and Delivery Costs. Applied Mathematical Modelling, 37(7), 4924-4937.
Razi, F. (2014). A supplier selection using a hybrid grey based hierarchical clustering and artificial bee colony. Decision Science Letters, 3(3), 259-268.
Selvarajah, E., & Zhang, R. (2014). Supply chain scheduling at the manufacturer to minimize inventory holding and delivery costs. International Journal of Production Economics, 147, Part A, 117-124.
Tadeusz, S. (2011). Scheduling in Supply Chains Using Mixed Integer Programming. Hoboken, New Jersey: John Wiley & Sons, Inc.
Talbi, E.-G. (2009). Metaheuristics: From Design to Implementation. Hoboken, New Jersey: John Wiley & Sons,.
Tyagi, N., Abedi, M., & Varshney, R. G. (2013). Single machine scheduling in a batch delivery system with fixed delivery dates. International Journal of Engineering and Technology, 5(4), 3484-3488.
Yin, Y., Cheng, T. C. E., Wu, C. C., & Cheng, S. R. (2013). Single-machine common due-date scheduling with batch delivery costs and resource-dependent processing times. International Journal of Production Research, 51(17), 5083-5099.
Yin, Y., Wang, Y., Cheng, T., Wang, D.-J., & Wu, C.-C. (2015). Two-agent single-machine scheduling to minimize the batch delivery cost. Computers & Industrial Engineering.
Ahmadizar, F., & Farhadi, S. (2015). Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs. Computers & Operations Research, 53, 194-205.
Chen, Z. L. (2010). Integrated production and outbound distribution scheduling: Review and extensions. Operations Research, 58(1), 130-148.
Chen, Z. L., & Vairaktarakis, G. L. (2005). Integrated scheduling of production and distribution operations. Management Science, 51(4), 614-628.
Cheng, T. C. E., Gordon, V. S., & Kovalyov, M. Y. (1996). Single machine scheduling with batch deliveries. European Journal of Operational Research, 94(2), 277-283.
Cheng, T. C. E., & Kahlbacher, H. G. (1993). Scheduling with delivery and earliness penalties. Asia-Pacific Journal of Operational Research, 10, 145-152.
Dauzère-Pérès, S. (1995). Minimizing late jobs in the general one machine scheduling problem. European Journal of Operational Research, 81(1), 134-142.
Detienne, B. (2014). A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints. European Journal of Operational Research, 235(3), 540-552.
Graham, e. a. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5(1), 287-326.
Haddad, H., Ghanbari, P., & Moghaddam, A. Z. (2012). A new mathematical model for single machine batch schedd{stroke}uling problem for minimizing maximum lateness with deteriorating jobs. International Journal of Industrial Engineering Computations, 3(2), 253-264.
Hall, N. G., & Potts, C. N. (2003). Supply chain scheduling: Batching and delivery. Operations Research, 51(4), 566-584+674.
Herrmann, J., & Ullrich, C. A. (2013). The cost-cutting potential of supply chain scheduling. SSRN: 1829138.
Ji, M., He, Y., & Cheng, T. C. E. (2007). Batch delivery scheduling with batch delivery cost on a single machine. European Journal of Operational Research, 176(2), 745-755.
Lee, C. Y., & Chen, Z. L. (2001). Machine scheduling with transportation considerations. Journal of Scheduling, 4(1), 3-24.
Lenstra, J. K., Rinnooy Kan, A. H. G., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 7, 343–362.
Li, C.-L. (2015). Improved algorithms for single-machine common due window assignment and scheduling with batch deliveries. Theoretical Computer Science, 570, 30-39.
Mazdeh, M. M., Esfahani, A. N., Sakkaki, S. E., & Pilerood, A. E. (2012). Single-machine batch scheduling minimizing weighted flow times and delivery costs with job release times. International Journal of Industrial Engineering Computations, 3(3), 347-364.
Mazdeh, M. M., Hamidinia, A., & Karamouzian, A. (2011). A mathematical model for weighted tardy jobs scheduling problem with a batched delivery system. International Journal of Industrial Engineering Computations, 2(3), 491-498.
Mazdeh, M. M., & Karamouzian, A. (2014). Evaluating strategic issues in supply chain scheduling using game theory. International Journal of Production Research, 1-14.
Mazdeh, M. M., Sarhadi, M., & Hindi, K. S. (2007). A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs. European Journal of Operational Research, 183(1), 74-86.
Mazdeh, M. M., Sarhadi, M., & Hindi, K. S. (2008). A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times. Computers and Operations Research, 35(4), 1099-1111.
Moore, J. M. (1968). An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs. Management Science, 15(1), 102-109.
Parhizkari, M., Amirib, M., & Mousakhani, M. (2013). A multiple criteria decision making technique for supplier selection and inventory management strategy: A case of multi-product and multi-supplier problem. Decision Science Letters, 2(3), 185-190.
Pundoor, G., & Chen, Z. L. (2005). Scheduling a production-distribution system to optimize the tradeoff between delivery tardiness and distribution cost. Naval Research Logistics, 52(6), 571-589.
Rasti-Barzoki, M., Hejazi, S. R., & Mazdeh, M. M. (2013). A Branch and Bound Algorithm to Minimize the Total Weighed Number of Tardy Jobs and Delivery Costs. Applied Mathematical Modelling, 37(7), 4924-4937.
Razi, F. (2014). A supplier selection using a hybrid grey based hierarchical clustering and artificial bee colony. Decision Science Letters, 3(3), 259-268.
Selvarajah, E., & Zhang, R. (2014). Supply chain scheduling at the manufacturer to minimize inventory holding and delivery costs. International Journal of Production Economics, 147, Part A, 117-124.
Tadeusz, S. (2011). Scheduling in Supply Chains Using Mixed Integer Programming. Hoboken, New Jersey: John Wiley & Sons, Inc.
Talbi, E.-G. (2009). Metaheuristics: From Design to Implementation. Hoboken, New Jersey: John Wiley & Sons,.
Tyagi, N., Abedi, M., & Varshney, R. G. (2013). Single machine scheduling in a batch delivery system with fixed delivery dates. International Journal of Engineering and Technology, 5(4), 3484-3488.
Yin, Y., Cheng, T. C. E., Wu, C. C., & Cheng, S. R. (2013). Single-machine common due-date scheduling with batch delivery costs and resource-dependent processing times. International Journal of Production Research, 51(17), 5083-5099.
Yin, Y., Wang, Y., Cheng, T., Wang, D.-J., & Wu, C.-C. (2015). Two-agent single-machine scheduling to minimize the batch delivery cost. Computers & Industrial Engineering.