A branch-and-bound algorithm for two-machine flow-shop scheduling problems with batch delivery costs

References

• Allahverdi, A., & Al-Anzi, F. (2002). Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problems for WWW applications. Computers and Operations Research, 29, 971–994.
   Web of Science ®Google Scholar
• Allahverdi, A., Al-Anzi, F.S., & Gupta, J.N.D. (2005). A polynomial genetic based algorithm to minimize maximum lateness in a two-stage flowshop with setup times. International Journal of Operations Research, 2(2), 89–100.
   Google Scholar
• Baker, K.R. (1974). Introduction to sequencing and scheduling. New York, NY: Wiley.
   Google Scholar
• Campbell, H., Dudek, R., & Smith, M. (1970). A heuristic algorithm for the n-job, m-machine sequencing problem. Management Science, 16, 630–637.
   Web of Science ®Google Scholar
• Dileepan, P., & Sen, T. (1991). Job lateness in a two-machine flowshop with setup times separated. Computers & Operations Research, 18(6), 549–556.
   Web of Science ®Google Scholar
• Grabowski, J., Skubalska, E., & Smutnicki, C. (1983). On flow shop scheduling with release and due dates to minimize maximum lateness. The Journal of the Operational Research Society, 34(7), 615–620.
   Web of Science ®Google Scholar
• Graham, R.L., Lawler, E.L., Lenstra, J.K, & Rinnooy Kan, A.H.G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Operations Research, 5, 287–326.
   Google Scholar
• Gupta, J.N.D. (1972). Optimal scheduling in a multistage flowshop. AIIE Transactions, 4, 238–243.
   Google Scholar
• Gupta, J.N.D., Neppall, V.R., & Werner, F. (2001). Minimizing total flow time in a two-machine flow-shop problem with minimum makespan. International Journal of Production Economics, 69, 323–338.
   Web of Science ®Google Scholar
• Hall, N., & Potts, C. (2005). The coordination of scheduling and batch deliveries. Annals of Operations Research, 135(1), 41–64.
   Web of Science ®Google Scholar
• Hall, N.G., & Potts, C.N. (2003). Supply chain scheduling: Batching and delivery. Operations Research, 51(4), 566–584.
   Web of Science ®Google Scholar
• Hamidinia, A., Khakabimamaghani, S., Mahdavi Mazdeh, M., & Jafari, M. (2011). A genetic algorithm for minimizing total tardiness/earliness of weighted jobs in a batched delivery system. Computers & Industrial Engineering.
   Web of Science ®Google Scholar
• Haouari, M., & Ladhari, T. (2000). Minimising maximum lateness in a two-machine flowshop. The Journal of the Operational Research Society, 51(9), 1100–1106.
   Web of Science ®Google Scholar
• 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, 745–755.
   Web of Science ®Google Scholar
• Johnson, S. (1954). Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1(1), 61–68.
   Google Scholar
• Lawler, E.L., Lenstra, J.K., & Kan, A.H.G.R. (1981). Minimizing maximum lateness in a two-machine open shop. Mathematics of Operations Research, 6(1), 153–158.
   Web of Science ®Google Scholar
• Lee, C.-Y., & Chen, Z.-L. (2001). Machine scheduling with transportation considerations. Journal of Scheduling, 4, 3–24.
   Web of Science ®Google Scholar
• Lenstra, J.K., Karl, A.H.G.R., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343–351.
   Google Scholar
• Lu, L., Yuan, J., & Zhang, L. (2008). Single machine scheduling with release dates and job delivery to minimize the makespan. Theoretical Computer Science, 393, 102–108.
   Web of Science ®Google Scholar
• Mazdeh, M.M., Rostami, M., & Namaki, M.H. (2013). Minimizing maximum tardiness and delivery costs in a batched delivery system. Computers & Industrial Engineering, 66, 675–682.
   Web of Science ®Google Scholar
• 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, 74–86.
   Web of Science ®Google Scholar
• 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 & Operations Research, 35, 1099–1111.
   Web of Science ®Google Scholar
• Mazdeh, M.M., Shashaani, S., Ashouri, A., & Hindi, K.S. (2011). Single-machine batch scheduling minimizing weighted flow times and delivery costs. Applied Mathematical Modelling, 35, 563–570.
   Web of Science ®Google Scholar
• Mazdeh, M.M., Naji Esfahani, A., Sakkaki, S.E., & Ebrahimzadeh Pilerood, A. (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.
   Google Scholar
• Palmer, D.S. (1965). Sequencing jobs through a multistage process in the minimum total time: A quick method of obtaining a near optimum. Operation Research Quarterly, 16, 101–107.
   Google Scholar
• 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, 571–589.
   Web of Science ®Google Scholar
• Santos, C., & Magazine, M. (1985). Batching in single operation manufacturing systems. Operations Research Letters, 4(3), 99–103.
   Web of Science ®Google Scholar
• Shabtay, D. (2010). Scheduling and due date assignment to minimize earliness, tardiness, holding, due date assignment and batch delivery costs. International Journal of Production Economics, 123, 235–242.
   Web of Science ®Google Scholar
• Soukhal, A., Oulamara, A., & Martineau, P. (2005). Complexity of flow shop scheduling problems with transportation constraints. European Journal of Operational Research, 161, 32–41.
   Web of Science ®Google Scholar
• Tadei, R., Gupta, J.N.D., Croce, F.D., & Cortesi, M. (1998). Minimising makespan in the two-machine flow-shop with release times. Journal of the Operational Research Society, 49, 77–85.
   Web of Science ®Google Scholar
• Townsend, W. (1977). Sequencing n jobs on m machines to minimise maximum tardiness: A branch-and-bound solution. Management Science, 23(9), 1016–1019.
   Web of Science ®Google Scholar