Heuristic Model for Dynamic Single Machine Group Scheduling in Laser Cutting Job Shop to Minimize the Makespan

Abstract:

In today’s highly competitive market, laser cutting which has a characteristic of “make to order” and high product variety is under pressure to reduce costs, to increase productivity and to respond to the rapidly changing demands from customers. To maintain the competitive advantage, companies need to have a real-time dynamic scheduling system, which can handle large combinations of jobs, allowing sequencing of jobs to achieve multi-objective goals. Motivated by a real-life scheduling problem in a sheet metal processing company in Malaysia, this research addressed single machine scheduling problem with sequence-dependent setup times and group technology assumption to minimize makespan and with the secondary objective of minimizing setup times. The focus of this paper is on developing a simple heuristic algorithm based dynamic scheduling system. This algorithm has been coded in vb.net and is integrated with a database system. The scheduling system developed is verified and validated by comparing to the actual production run. Results show that the algorithm model can find good solutions within short computational time.

• Periodical: Advanced Materials Research (Volumes 383-390)
• Pages: 6236-6241
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.383-390.6236
• Online since: November 2011
• Authors: Nyeoh Cheng Ying, Mohzani Bin Mokhtar
• Keywords: Make Span, Scheduling, Sequence-Dependent Setup Time, Single-Machine

References

[1] C.Y. Nyeoh, M. Mokhtar, and J.F. Chin: Systematic Approach to Reduce Set-Up for Single Machine Scheduling in Laser Cutting Job Shop. International Conference on Advances in Mechanical Engineering 2009, Concorde Hotel, Shah Alam, Malaysia, June 24 – 25.

[2] W.C. Lee, C.C. Wu, and Y.H. Chung: Scheduling deteriorating jobs on a single machine with release times. Computers & Industrial Engineering 5 (2008), pp.441-452.

DOI: 10.1016/j.cie.2007.08.006

[3] J. B. Wang, W. J. Gao, L. Y. Wang, and D. Wang: Single machine group scheduling with general linear deterioration to minimize makespan. International Journal of Advanced Manufacturing Technology 43 (2009), p.146 – 150.

DOI: 10.1007/s00170-008-1667-2

[4] C. Low, C. J. Hsu, and C. T. Su: Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration. Computers and Mathematics with Applications 56 (2008), p.257 – 265.

DOI: 10.1016/j.camwa.2007.12.006

[5] W. H. Kuo, and D. L. Yang: Minimizing the makespan in a single machine scheduling problem with the cyclic process of an aging effect. Journal of the Operational Research Society 59 (2008), p.16 – 420.

DOI: 10.1057/palgrave.jors.2602363

[6] J. J. Yuan, Z. H. Liu, C. T. Ng, and T. C. E. Cheng: Single machine batch scheduling problem with family setup times and release dates to minimize makespan. Journal of scheduling 9 (2006), p.499 – 513.

DOI: 10.1007/s10951-006-8776-2

[7] T.C. E. Cheng, Y. K. Mikhail, C. T. Ng, and S.S. Lam: Group sequencing around a common due date. Discrete Optimization 5 (2008), pp.594-604.

DOI: 10.1016/j.disopt.2006.04.003

[8] Ali Allahverdi and H. M. Soroush: The significance of reducing setup times/setup costs. European Journal of Operation Research 187 (2008), p.978 – 984.

DOI: 10.1016/j.ejor.2006.09.010

[10] T. Eren: A multicriteria scheduling with sequence-dependent setup times. Applied Mathematical Sciences, Vol. 1, No. 28 (2007), p.2883 – 2894.

[11] Y. H. Lee, K. Bhaskaran, and M. Pinedo: A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Transactions 29 (1997), pp.45-52.

DOI: 10.1080/07408179708966311