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

被引:4
作者
Ying, Nyeoh Cheng [1 ,2 ]
Bin Mokhtar, Mohzani [2 ]
机构
[1] Multimedia Univ MMU, Fac Engn & Technol, Jalan Air Keroh Lama, Melaka 75450, Malaysia
[2] USM, Sch Mech Engn, Nibong Tebal 14300, Malaysia
来源
MANUFACTURING SCIENCE AND TECHNOLOGY, PTS 1-8 | 2012年 / 383-390卷
关键词
scheduling; single-machine; sequence-dependent setup time; makespan; LINEAR DETERIORATION; TIMES;
D O I
10.4028/www.scientific.net/AMR.383-390.6236
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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.
引用
收藏
页码:6236 / +
页数:2
相关论文
共 10 条
[1]   The significance of reducing setup times/setup costs [J].
Allahverdi, Ali ;
Soroush, H. M. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 187 (03) :978-984
[2]   Group sequencing around a common due date [J].
Cheng, T. C. Edwin ;
Kovalyov, Mikhail Y. ;
Ng, C. T. ;
Lam, S. S. .
DISCRETE OPTIMIZATION, 2008, 5 (03) :594-604
[3]  
Eren T., 2007, APPL MATH SCI, V1, P2883
[4]  
Kuo W. H., 2008, J OPERATIONAL RES SO, V59, P16
[5]   Scheduling deteriorating jobs on a single machine with release times [J].
Lee, Wen-Chiung ;
Wu, Chin-Chia ;
Chung, Yu-Hsiang .
COMPUTERS & INDUSTRIAL ENGINEERING, 2008, 54 (03) :441-452
[6]   A heuristic to minimize the total weighted tardiness with sequence-dependent setups [J].
Lee, YH ;
Bhaskaran, K ;
Pinedo, M .
IIE TRANSACTIONS, 1997, 29 (01) :45-52
[7]   Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration [J].
Low, Chinyao ;
Hsu, Chou-Jung ;
Su, Chwen-Tzeng .
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2008, 56 (01) :257-265
[8]  
Nyeoh C.Y., INT C ADV MECH ENG 2
[9]   Single machine group scheduling with general linear deterioration to minimize the makespan [J].
Wang, Ji-Bo ;
Gao, Wen-Jun ;
Wang, Li-Yan ;
Wang, Dan .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 43 (1-2) :146-150
[10]   Single machine batch scheduling problem with family setup times and release dates to minimize makespan [J].
Yuan, J. J. ;
Liu, Z. H. ;
Ng, C. T. ;
Cheng, T. C. E. .
JOURNAL OF SCHEDULING, 2006, 9 (06) :499-513