618
Views
20
CrossRef citations to date
0
Altmetric
Articles

Modelling and symmetry breaking in scheduling problems on batch processing machines

ORCID Icon, , &
Pages 7031-7048 | Received 30 Jun 2017, Accepted 18 Dec 2017, Published online: 20 Jan 2018

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–385.
  • Chang, P.-Y. , P. Damodaran , and S. Melouk . 2004. “Minimizing Makespan on Parallel Batch Processing Machines.” International Journal of Production Research 42 (19): 4211–4220.
  • Chen, H. , B. Du , and G. Q. Huang . 2011. “Scheduling a Batch Processing Machine with Non-identical Job Sizes: A Clustering Perspective.” International Journal of Production Research 49 (19): 5755–5778.
  • Cheng, B. , Q. Wang , S. Yang , and X. Hu . 2013. “An Improved Ant Colony Optimization for Scheduling Identical Parallel Batching Machines with Arbitrary Job Sizes.” Applied Soft Computing 13 (2): 765–772.
  • Cheng, B. , S. Yang , X. Hu , and B. Chen . 2012. “Minimizing Makespan and Total Completion Time for Parallel Batch Processing Machines with Non-identical Job Sizes.” Applied Mathematical Modelling 36 (7): 3161–3167.
  • Chou, F.-D. , P.-C. Chang , and H.-M. Wang . 2005. “A Hybrid Genetic Algorithm to Minimize Makespan for the Single Batch Machine Dynamic Scheduling Problem.” The International Journal of Advanced Manufacturing Technology 31 (3–4): 350–359.
  • Chung, S. H. , Y. T. Tai , and W. L. Pearn . 2009. “Minimising Makespan on Parallel Batch Processing Machines with Non-identical Ready Time and Arbitrary Job Sizes.” International Journal of Production Research 47 (18): 5109–5128.
  • Damodaran, P. , O. Ghrayeb , and M. C. Guttikonda . 2013. “GRASP to Minimize Makespan for a Capacitated Batch-processing Machine.” The International Journal of Advanced Manufacturing Technology 68 (1–4): 407–414.
  • Damodaran, P. , N. S. Hirani , and M. C. Velez-Gallego . 2009. “Scheduling Identical Parallel Batch Processing Machines to Minimise Makespan Using Genetic Algorithms.” European Journal of Industrial Engineering 3 (2): 187–206. doi:10.1504/EJIE.2009.023605.
  • Damodaran, P. , P. Kumar Manjeshwar , and K. Srihari . 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. , M. C. Velez-Gallego , and J. Maya . 2009. “A GRASP Approach for Makespan Minimization on Parallel Batch Processing Machines.” Journal of Intelligent Manufacturing 22 (5): 767–777.
  • Ghazvini, F. J. , and L. Dupont . 1998. “Minimizing Mean Flow Times Criteria on a Single Batch Processing Machine with Non-identical Jobs Sizes.” International Journal of Production Economics 55: 273–280.
  • Jia, Z. , and J. Y.-T. Leung . 2015. “A Meta-heuristic to Minimize Makespan for Parallel Batch Machines with Arbitrary Job Sizes.” European Journal of Operational Research 240 (3): 649–665.
  • Kashan, A. H. , B. Karimi , and M. Jenabi . 2008. “A Hybrid Genetic Heuristic for Scheduling Parallel Batch Processing Machines with Arbitrary Job Sizes.” Computers & Operations Research 35 (4): 1084–1098.
  • Kashan, A. H. , B. Karimi , and F. Jolai . 2006. “Effective Hybrid Genetic Algorithm for Minimizing Makespan on a Single-batch-processing Machine with Non-identical Job Sizes.” International Journal of Production Research 44 (12): 2337–2360.
  • Köhler, V. , M. Fampa , and O. Araújo . 2012. “Mixed-integer Linear Programming Formulations for the Software Clustering Problem.” Computational Optimization and Applications 55 (1): 113–135.
  • Lee, Y. H. , and Y. H. Lee . 2013. “Minimising Makespan Heuristics for Scheduling a Single Batch Machine Processing Machine with Non-identical Job Sizes.” International Journal of Production Research 51 (12): 3488–3500.
  • Margot, F. 2010. “Symmetry in Integer Linear Programming.” In 50 Years of Integer Programming 1958--2008, edited by M. Jünger , Th. M. Liebling , D. Naddef , G. L. Nemhauser , W. R. Pulleyblank , G. Reinelt , G. Rinaldi and L. A. Wolsey . Berlin, Heidelberg: Springer. doi:10.1007/978-3-540-68279-0_17.
  • Melouk, S. , P. Damodaran , and P.-Y. Chang . 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.
  • Meng, Y. , and L. Tang . 2010. “A Tabu Search Heuristic to Solve the Scheduling Problem for a Batch-processing Machine with Non-identical Job Sizes.” 2010 International Conference on Logistics Systems and Intelligent Management (ICLSIM), Vol. 3, Berlin, Heidelberg, 1703–1707.
  • Rafiee Parsa, N. , B. Karimi , and A. H. Kashan . 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.
  • Uzsoy, R. 1994. “Scheduling a Single Batch Processing Machine with Non-identical Job Sizes.” International Journal of Production Research 32 (7): 1615–1635.
  • Velez-Gallego, M. C. 2009. “Algorithms for Scheduling Parallel Batch Processing Machines with Non-identical Job Ready Times.” Ph.D. thesis. Florida, USA: Florida International University.
  • Xu, R. , H. Chen , and X. Li . 2012. “Makespan Minimization on Single Batch-processing Machine via Ant Colony Optimization.” Computers & Operations Research 39 (3): 582–593.
  • Zhang, G. , X. Cai , C.-Y. Lee , and C. Wong . 2001. “Minimizing Makespan on a Single Batch Processing Machine with Non-identical Job Sizes.” Naval Research Logistics 48 (3): 226–240.
  • Zhou, S. , H. Chen , R. Xu , and X. Li . 2014. “Minimising 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.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.