How to cite this paper
APA: Beldar, P & Costa, A. (2018). Single machine batch processing problem with release dates to minimize total completion time. International Journal of Industrial Engineering Computations, 9(3), 331-348.
Chicago/Turabian: Beldar, P & Costa, A. 2018. "Single machine batch processing problem with release dates to minimize total completion time." International Journal of Industrial Engineering Computations 9, no. 3 (2018): 331-348.
AMA: Beldar, P & Costa, A. Single machine batch processing problem with release dates to minimize total completion time. International Journal of Industrial Engineering Computations. 2018;9(3):331-348.
References
Al-Salamah, M. (2015). Constrained binary artificial bee colony to minimize the makespan for single machine batch processing with non-identical job sizes. Applied Soft Computing, 29, 379 -85.
Arabameri, S., & Salmasi, N. (2013). Minimization of weighted earliness and tardiness for no-wait sequence-dependent setup times flow-shop scheduling problem. Computers & Industrial Engineering, 64(4), 902-916.
Baker, R.K., & Trietsch, D. (2009). Principles of Sequencing and Scheduling; New Jersey: John Wiley & Sons.
Chandru,V., Lee, C.Y., & Uzsoy, R. (1993). Minimizing total completion time on a batch processing machine with job families. Operations Research Letters, 13(2), 61-65.
Chang, P.C., & Wang, H.M. (2004). A heuristic for a batch processing machine scheduled to minimize total completion time with non- identical job sizes. The International Journal of Advanced Manufacturing Technology, 24(7), 615-620.
Chen, Y.Y., Cheng, C.Y., Wang, L.C., & Chen, T.L. (2013). A hybrid approach based on the variable neighborhood search and particle swarm optimization for parallel machine scheduling problems: a case study for solar cell industry. International Journal of Production Economics, 141(1), 66-78.
Coello Coello, C.A., Lamont, G.B., & Van Veldhuizen, D.A. (2007). Alternative Meta-heuristics: Boston, MA: Springer US.
Corder, G.W., & Foreman, D.I. (2014). Nonparametric Statistics: A Step-by-Step Approach. New Jersey: John Wiley & Sons.
Costa, A., Alfieri, A., Matta, A., & Fichera, S. (2015). A parallel tabu search for solving the primal buffer allocation problem in serial production systems. Computers & Operations Research, 64, 97-112.
Costa, A., Cappadonna, F.A., & Fichera, S. (2016). Minimizing the total completion time on a parallel machine system with tool changes. Computers & Industrial Engineering, 91, 290-301.
Costa, A., Cappadonna, F.A., & Fichera, S. (2017). A hybrid genetic algorithm for minimizing makespan in a flow-shop sequence-dependent group scheduling problem. Journal of Intelligent Manufacturing, 8(6), 1269-1283.
Damodaran, P., Manjeshwar, P.K., & Srihari, K. (2006). Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms. International Journal of Production Economics, 103(2), 882-891.
Damodaran, P., Srihari, K., & Lam, S.S. (2007). Scheduling a capacitated batch-processing machine to minimize makespan. Robotics and Computer-Integrated Manufacturing, 23(2), 208-2016.
Damodaran, P., Diyadawagamage, D.A., Ghrayeb, O., & Velez-Gallego, M.C. (2012). A particle swarm optimization algorithm for minimizing makespan of non-identical parallel batch processing machines. The International Journal of Advanced Manufacturing Technology, 58(9), 1131-1140.
Dupont, L., & Dhaenens-Flipo, C. (2002). Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure. Computers & Operations Research, 29(7), 807-819.
Gao, H., Kwong, S., Fan, B., & Wang, R. (2014). A Hybrid Particle-Swarm Tabu Search Algorithm for Solving Job Shop Scheduling Problems, IEEE Transactions on Industrial Informatics, 10(4), 2044-2054.
Glover, F., & Laguna, M. (1999). Tabu Search. Boston, MA: Springer US.
Gohari, S., & Salmasi, N. (2015). Flexible flowline scheduling problem with constraints for the beginning and terminating time of processing of jobs at stages. International Journal of Computer Integrated Manufacturing, 28(10), 1092-1105.
Javidrad F., Nazari M.. (2017). A new hybrid particle swarm and simulated annealing stochastic optimization method. Applied Soft Computing, 60, 634-654.
Jia, Zh., & Leung, J.Y.T. (2014). An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes. Computers & Operations Research, 46, 49-58.
Jolai, F., & Dupont, L. (1997). Minimizing mean flow times criteria on a single batch processing machine with non-identical jobs sizes. International journal of production economics, 55, 273-280.
Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. In: Neural Networks, 1995 Proceedings., IEEE International Conference on, 4, 1942-1948.
Kuo, R.J., & Han, Y.S. (2011). A hybrid of genetic algorithm and particle swarm optimization for solving bi-level linear programming problem – A case study on supply chain model. Applied Mathematical Modelling, 35(8), 3905 – 3917.
Kwak, J.S. (2005). Application of taguchi and response surface methodologies for geometric error in surface grinding process. International Journal of Machine Tools and Manufacture, 45(3), 327-334.
Lee, C.Y. (1999). Minimizing makespan on a single batch processing machine with dynamic job arrivals. International Journal of Production Research, 37(1), 219-236.
Lee, Y.H., & Lee, Y.H. (2013). Minimizing makespan heuristics for scheduling a single batch machine processing machine with non-identical job sizes. International Journal of Production Research, 51(12), 3488-3500.
Li, Z., Chen, H., Xu, R., & Li, X. (2015). Earliness–tardiness minimization on scheduling a batch processing machine with non-identical job sizes. Computers & Industrial Engineering, 87, 590-599.
Liao, L.M., & Huang, C.J. (2011). Tabu search heuristic for two-machine flowshop with batch processing machines. Computers & Industrial Engineering, 60(3), 426-432.
Lin, H., & Kang L. (1999). Balance between exploration and exploitation in genetic search, Wuhan University Journal of Natural Sciences, 4(1), 28–32.
Liu, Z., & Yu, W. (2000). Scheduling one batch processor subject to job release dates. Discrete Applied Mathematics, 105(13), 129-136.
Mann, H.B., & Whitney, D.R. (1947). On a test of whether one of two random variables is stochastically larger than the other. he Annals of Mathematical Statistics, 18(1), 50-60.
Melouk, S., Damodaran, P., & Chang, P.Y. (2004). Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing. International Journal of Production Economics, 87(2), 141-147.
Michalewicz, Z. (1996). Genetic Algorithms + Data Structures = Evolution Programs. Springer Science & Business Media.
Parsa, N.R., Karimi, B., & Kashan, A.H. (2010). A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes. Computers & Operations Research, 37(10), 1720-1730.
Parsa, N. R., Karimi, B., & Husseini, S. M. (2016). Minimizing total flow time on a batch processing machine using a hybrid max–min ant system. Computers & Industrial Engineering, 99, 372-381.
Poli, R., Kennedy, J., & Blackwell, T. (2007). Particle swarm optimization. Swarm Intelligence, 1(1), 33-57.
Raymond, H.M., Douglas, C.M., & Christine, M. AC. (2009). Response Surface Methodology: Process and Product Optimization Using Designed Experiments. New Jersey: John Wiley & Sons.
Sha, D.Y., Hsu, C.-Y. (2006). A hybrid particle swarm optimization for job shop scheduling problem. Computers & Industrial Engineering, 51(4), 791-808.
Shi, Y., & Eberhart, R.C. (1950). Empirical study of particle swarm optimization. In: Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), 3, 1950 vol. 3.
Simon, D. (2013). Evolutionary Optimization Algorithms; New Jersey: John Wiley & Sons.
Tadayon, B., & Salmasi, N. (2013). A two-criteria objective function flexible flowshop scheduling problem with machine eligibility constraint. The International Journal of Advanced Manufacturing Technology, 64(5), 1001-1015.
Uzsoy, R. (1994). Scheduling a single batch processing machine with non-identical job sizes. International Journal of Production Research, 32(7), 1615-1635.
Uzsoy, R., & Yang, Y. (1997). Minimizing total weighted completion time on a single batch processing machine. Production and Operations Management, 6(1), 57-73.
Xia, W.-J., & Wu, Z.-M. (2006). A hybrid particle swarm optimization approach for the job-shop scheduling problem. International Journal of Advanced Manufacturing Technology, 29(3–4), 360–366.
Xu, R., Chen, H., & Li, X. (2012). Makespan minimization on single batch-processing machine via ant colony optimization. Computers & Operations Research, 39(3), 582-593.
Zhou, S., Chen, H., Xu, R., Li, X. (2014). Minimizing makespan on a single batch processing machine with dynamic job arrivals and non-identical job sizes. International Journal of Production Research, 52(8), 2258-2274.
Arabameri, S., & Salmasi, N. (2013). Minimization of weighted earliness and tardiness for no-wait sequence-dependent setup times flow-shop scheduling problem. Computers & Industrial Engineering, 64(4), 902-916.
Baker, R.K., & Trietsch, D. (2009). Principles of Sequencing and Scheduling; New Jersey: John Wiley & Sons.
Chandru,V., Lee, C.Y., & Uzsoy, R. (1993). Minimizing total completion time on a batch processing machine with job families. Operations Research Letters, 13(2), 61-65.
Chang, P.C., & Wang, H.M. (2004). A heuristic for a batch processing machine scheduled to minimize total completion time with non- identical job sizes. The International Journal of Advanced Manufacturing Technology, 24(7), 615-620.
Chen, Y.Y., Cheng, C.Y., Wang, L.C., & Chen, T.L. (2013). A hybrid approach based on the variable neighborhood search and particle swarm optimization for parallel machine scheduling problems: a case study for solar cell industry. International Journal of Production Economics, 141(1), 66-78.
Coello Coello, C.A., Lamont, G.B., & Van Veldhuizen, D.A. (2007). Alternative Meta-heuristics: Boston, MA: Springer US.
Corder, G.W., & Foreman, D.I. (2014). Nonparametric Statistics: A Step-by-Step Approach. New Jersey: John Wiley & Sons.
Costa, A., Alfieri, A., Matta, A., & Fichera, S. (2015). A parallel tabu search for solving the primal buffer allocation problem in serial production systems. Computers & Operations Research, 64, 97-112.
Costa, A., Cappadonna, F.A., & Fichera, S. (2016). Minimizing the total completion time on a parallel machine system with tool changes. Computers & Industrial Engineering, 91, 290-301.
Costa, A., Cappadonna, F.A., & Fichera, S. (2017). A hybrid genetic algorithm for minimizing makespan in a flow-shop sequence-dependent group scheduling problem. Journal of Intelligent Manufacturing, 8(6), 1269-1283.
Damodaran, P., Manjeshwar, P.K., & Srihari, K. (2006). Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms. International Journal of Production Economics, 103(2), 882-891.
Damodaran, P., Srihari, K., & Lam, S.S. (2007). Scheduling a capacitated batch-processing machine to minimize makespan. Robotics and Computer-Integrated Manufacturing, 23(2), 208-2016.
Damodaran, P., Diyadawagamage, D.A., Ghrayeb, O., & Velez-Gallego, M.C. (2012). A particle swarm optimization algorithm for minimizing makespan of non-identical parallel batch processing machines. The International Journal of Advanced Manufacturing Technology, 58(9), 1131-1140.
Dupont, L., & Dhaenens-Flipo, C. (2002). Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure. Computers & Operations Research, 29(7), 807-819.
Gao, H., Kwong, S., Fan, B., & Wang, R. (2014). A Hybrid Particle-Swarm Tabu Search Algorithm for Solving Job Shop Scheduling Problems, IEEE Transactions on Industrial Informatics, 10(4), 2044-2054.
Glover, F., & Laguna, M. (1999). Tabu Search. Boston, MA: Springer US.
Gohari, S., & Salmasi, N. (2015). Flexible flowline scheduling problem with constraints for the beginning and terminating time of processing of jobs at stages. International Journal of Computer Integrated Manufacturing, 28(10), 1092-1105.
Javidrad F., Nazari M.. (2017). A new hybrid particle swarm and simulated annealing stochastic optimization method. Applied Soft Computing, 60, 634-654.
Jia, Zh., & Leung, J.Y.T. (2014). An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes. Computers & Operations Research, 46, 49-58.
Jolai, F., & Dupont, L. (1997). Minimizing mean flow times criteria on a single batch processing machine with non-identical jobs sizes. International journal of production economics, 55, 273-280.
Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. In: Neural Networks, 1995 Proceedings., IEEE International Conference on, 4, 1942-1948.
Kuo, R.J., & Han, Y.S. (2011). A hybrid of genetic algorithm and particle swarm optimization for solving bi-level linear programming problem – A case study on supply chain model. Applied Mathematical Modelling, 35(8), 3905 – 3917.
Kwak, J.S. (2005). Application of taguchi and response surface methodologies for geometric error in surface grinding process. International Journal of Machine Tools and Manufacture, 45(3), 327-334.
Lee, C.Y. (1999). Minimizing makespan on a single batch processing machine with dynamic job arrivals. International Journal of Production Research, 37(1), 219-236.
Lee, Y.H., & Lee, Y.H. (2013). Minimizing makespan heuristics for scheduling a single batch machine processing machine with non-identical job sizes. International Journal of Production Research, 51(12), 3488-3500.
Li, Z., Chen, H., Xu, R., & Li, X. (2015). Earliness–tardiness minimization on scheduling a batch processing machine with non-identical job sizes. Computers & Industrial Engineering, 87, 590-599.
Liao, L.M., & Huang, C.J. (2011). Tabu search heuristic for two-machine flowshop with batch processing machines. Computers & Industrial Engineering, 60(3), 426-432.
Lin, H., & Kang L. (1999). Balance between exploration and exploitation in genetic search, Wuhan University Journal of Natural Sciences, 4(1), 28–32.
Liu, Z., & Yu, W. (2000). Scheduling one batch processor subject to job release dates. Discrete Applied Mathematics, 105(13), 129-136.
Mann, H.B., & Whitney, D.R. (1947). On a test of whether one of two random variables is stochastically larger than the other. he Annals of Mathematical Statistics, 18(1), 50-60.
Melouk, S., Damodaran, P., & Chang, P.Y. (2004). Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing. International Journal of Production Economics, 87(2), 141-147.
Michalewicz, Z. (1996). Genetic Algorithms + Data Structures = Evolution Programs. Springer Science & Business Media.
Parsa, N.R., Karimi, B., & Kashan, A.H. (2010). A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes. Computers & Operations Research, 37(10), 1720-1730.
Parsa, N. R., Karimi, B., & Husseini, S. M. (2016). Minimizing total flow time on a batch processing machine using a hybrid max–min ant system. Computers & Industrial Engineering, 99, 372-381.
Poli, R., Kennedy, J., & Blackwell, T. (2007). Particle swarm optimization. Swarm Intelligence, 1(1), 33-57.
Raymond, H.M., Douglas, C.M., & Christine, M. AC. (2009). Response Surface Methodology: Process and Product Optimization Using Designed Experiments. New Jersey: John Wiley & Sons.
Sha, D.Y., Hsu, C.-Y. (2006). A hybrid particle swarm optimization for job shop scheduling problem. Computers & Industrial Engineering, 51(4), 791-808.
Shi, Y., & Eberhart, R.C. (1950). Empirical study of particle swarm optimization. In: Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), 3, 1950 vol. 3.
Simon, D. (2013). Evolutionary Optimization Algorithms; New Jersey: John Wiley & Sons.
Tadayon, B., & Salmasi, N. (2013). A two-criteria objective function flexible flowshop scheduling problem with machine eligibility constraint. The International Journal of Advanced Manufacturing Technology, 64(5), 1001-1015.
Uzsoy, R. (1994). Scheduling a single batch processing machine with non-identical job sizes. International Journal of Production Research, 32(7), 1615-1635.
Uzsoy, R., & Yang, Y. (1997). Minimizing total weighted completion time on a single batch processing machine. Production and Operations Management, 6(1), 57-73.
Xia, W.-J., & Wu, Z.-M. (2006). A hybrid particle swarm optimization approach for the job-shop scheduling problem. International Journal of Advanced Manufacturing Technology, 29(3–4), 360–366.
Xu, R., Chen, H., & Li, X. (2012). Makespan minimization on single batch-processing machine via ant colony optimization. Computers & Operations Research, 39(3), 582-593.
Zhou, S., Chen, H., Xu, R., Li, X. (2014). Minimizing makespan on a single batch processing machine with dynamic job arrivals and non-identical job sizes. International Journal of Production Research, 52(8), 2258-2274.