000 06441nas|a2200493 a 4500
005 20260818133458.0
008 060124s2005 th uu|m rtt 0| a1eng d
035 _a.b11978429
099 9 _aAIT Diss. no.ISE-05-02
100 0 _aChatpon Mongkalig
245 1 0 _aHeuristics for job shop scheduling problems with progressive weighted tardiness penalties and inter-machine overlapping sequence-dependent setup times
260 _aPathum Thani, Thailand :
_bAsian Institute of Technology,
_c2005
300 _a137 p. :
_bill.
490 1 _aDissertation ;
_vno. ISE-05-02
500 _aA dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Engineering, School of Advanced Technologies
502 _aThesis (Ph.D.) - Asian Institute of Technology, 2005
520 _aThis dissertation looks into new job shop scheduling problems with new measures of performance and new constraints. New heuristic methods, which are sequential NT-T-L heuristic approach and sequential NT-T-E&T heuristic method, are developed to solve job shop scheduling problems with earliness and tardiness penalties. The experimental results indicate that active schedules generated by the sequential NT-T-E&T heuristic method is significantly superior to the efficient bi-direction scheduling algorithm, and other heuristics. The performance measures proposed in this research are new customer-based measures of performance. The repetitive penalties increase at a constant progressive rate, depending on how many times late delivery of finished products to each customer occurs. The new performance measures are as follows: (i) total progressive weighted tardiness and (ii) total earliness and progressive weighted tardiness. New constraints, which are intermachine overlapping sequence-dependent setup times, are proposed in the new job shop scheduling problems. To reduce machine idle time and generate more effective complete schedules, direct processing times of preceding operations and machine setups of successive operations of the same job (batch of parts) are initiated simultaneously. New heuristic methods, which are the MPWT heuristic method, and five modified priority rules - LWKRS, MWKRS, SMST, SSPT, and SSTPT rules, are developed to solve conflicting operations in the set of active and nondelay schedules. There are three important experiments. The objective of the first experiment is to determine the necessity of sequence-dependent setup time consideration in the priority rules to solve the conflicting operations in the set of active and nondelay schedules. The experimental results indicate that, based on the following measures of performance: (i) total progressive weighted tardiness (ii) total earliness and progressive weighted tardiness and (iii) total earliness and tardiness, the modified priority rules with sequence-dependent setup time consideration are superior to the classical priority rules. The objective of the second experiment is to compare the active schedules generated by the MPWT heuristic method with the optimal solution. Based on total earliness and progressive weighted tardiness, it can be found that four out of ten results of the proposed heuristic procedure yield the optimal solution, and the percentage of the difference between the results of the proposed heuristic approach and the optimal solution are less than 20%. Therefore, the modified active schedule generation algorithm using the MPWT heuristic method yields very good results with significantly less computational time. The objective of the third experiment is to compare the proposed MPWT heuristic method with efficient heuristics, which are the BATCS, SMST, and LWKRS rules for solving the conflicting operations in the set of active schedules. The results obtained by the third experiment indicate that for solving the conflicting operations in the set of active schedules, the proposed MPWT heuristic method is superior to the BATCS, SMST, and LWKRS rules based on total earliness and progressive weighted tardiness, and total earliness and tardiness performance measures. An automotive parts factory is selected to be a case study. The MPWT heuristic method is then compared with other efficient heuristics based on the real scheduling data. The average of total earliness and progressive weighted tardiness of the schedules obtained by the modified active schedule generation algorithm using the MPWT heuristic method is lower than that of the modified active schedule generation algorithm using the sequential NT-T-E&T heuristic method and the BATCS rule, the modified nondelay schedule generation algorithm using the SSPT rule and the modified nondelay schedule generation algorithm using the EDD rule by 8.8%, 13.15%, 29.7%, and 30.95%, respectively.
650 0 _aHeuristic programming
650 0 _aProduction scheduling
700 1 _aTabucanon, Mario T.,
_eChairperson
700 1 _aPaul, Himangshu,
_eExamination Committee
700 1 _aBohez, Erik L.J.,
_eExamination Committee
700 0 _aNguyen Van Hop,
_eExamination committee
700 1 _aCheng, T. C. Edwin,
_eExamination committee
710 2 _aThe Royal Thai Government,
_eScholarship donor
710 2 _aDhurakij Pundit University, Thailand,
_eScholarship donor
810 2 _aAsian Institute of Technology.
_tDissertation ;
_vno. ISE-05-02
856 _3Full-Text
_u http://203.159.5.9/ait-thesis/detail.php?q=B09406
907 _a.b11978429
_bmnait
_cu
902 _a240826
998 _b0
_c060113
_dm
_ea
_fu
_g0
945 _lmnait
945 _lmnarc
945 _lmnarc
945 _lmnait
942 _c20
942 _c22
942 _c40
909 _aBarcode : 30050120905681
_bCREATED : 2006-01-13
_cRECORD # : i12471203
_dLPATRON : 1018146
_eLCHKIN : 2009-03-14
_f# RENEWALS : 0
_g# OVERDUE : 0
_hIUSE3 : 1
_iTOT CHKOUT : 6
_jTOT RENEW : 2
909 _aBarcode : 30050120594865
_bCREATED : 2012-08-16
_cRECORD # : i12687388
_dLPATRON : 0
_eLCHKIN : -
_f# RENEWALS : 0
_g# OVERDUE : 0
_hIUSE3 : 0
_iTOT CHKOUT : 0
_jTOT RENEW : 0
909 _aBarcode : 30050160002456
_bCREATED : 2016-02-17
_cRECORD # : i1288375x
_dLPATRON : 0
_eLCHKIN : -
_f# RENEWALS : 0
_g# OVERDUE : 0
_hIUSE3 : 0
_iTOT CHKOUT : 0
_jTOT RENEW : 0
909 _aBarcode : 30050121006182
_bCREATED : 2021-05-02
_cRECORD # : i13320865
_dLPATRON : 0
_eLCHKIN : -
_f# RENEWALS : 0
_g# OVERDUE : 0
_hIUSE3 : 1
_iTOT CHKOUT : 0
_jTOT RENEW : 0
999 _c54887
_d54887