Heuristics for job shop scheduling problems with progressive weighted tardiness penalties and inter-machine overlapping sequence-dependent setup times (Record no. 54887)

MARC details
000 -LEADER
fixed length control field 06441nas|a2200493 a 4500
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20260818133458.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 060124s2005 th uu|m rtt 0| a1eng d
035 ## - SYSTEM CONTROL NUMBER
System control number .b11978429
099 #9 - LOCAL FREE-TEXT CALL NUMBER (OCLC)
Classification number AIT Diss. no.ISE-05-02
100 0# - MAIN ENTRY--PERSONAL NAME
Personal name Chatpon Mongkalig
245 10 - TITLE STATEMENT
Title Heuristics for job shop scheduling problems with progressive weighted tardiness penalties and inter-machine overlapping sequence-dependent setup times
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. Pathum Thani, Thailand :
Name of publisher, distributor, etc. Asian Institute of Technology,
Date of publication, distribution, etc. 2005
300 ## - PHYSICAL DESCRIPTION
Extent 137 p. :
Other physical details ill.
490 1# - SERIES STATEMENT
Series statement Dissertation ;
Volume/sequential designation no. ISE-05-02
500 ## - GENERAL NOTE
General note A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Engineering, School of Advanced Technologies
502 ## - DISSERTATION NOTE
Dissertation note Thesis (Ph.D.) - Asian Institute of Technology, 2005
520 ## - SUMMARY, ETC.
Summary, etc. This 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 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Heuristic programming
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Production scheduling
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Tabucanon, Mario T.,
Relator term Chairperson
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Paul, Himangshu,
Relator term Examination Committee
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Bohez, Erik L.J.,
Relator term Examination Committee
700 0# - ADDED ENTRY--PERSONAL NAME
Personal name Nguyen Van Hop,
Relator term Examination committee
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Cheng, T. C. Edwin,
Relator term Examination committee
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element The Royal Thai Government,
Relator term Scholarship donor
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element Dhurakij Pundit University, Thailand,
Relator term Scholarship donor
810 2# - SERIES ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element Asian Institute of Technology.
Title of a work Dissertation ;
Volume/sequential designation no. ISE-05-02
856 ## - ELECTRONIC LOCATION AND ACCESS
Materials specified Full-Text
Uniform Resource Identifier <a href=" http://203.159.5.9/ait-thesis/detail.php?q=B09406"> http://203.159.5.9/ait-thesis/detail.php?q=B09406</a>
907 ## - LOCAL DATA ELEMENT G, LDG (RLIN)
a .b11978429
b mnait
c u
902 ## - LOCAL DATA ELEMENT B, LDB (RLIN)
a 240826
998 ## - LOCAL CONTROL INFORMATION (RLIN)
Operator's initials, OID (RLIN) 0
Cataloger's initials, CIN (RLIN) 060113
First date, FD (RLIN) m
-- a
-- u
-- 0
945 ## - LOCAL PROCESSING INFORMATION (OCLC)
l mnait
945 ## - LOCAL PROCESSING INFORMATION (OCLC)
l mnarc
945 ## - LOCAL PROCESSING INFORMATION (OCLC)
l mnarc
945 ## - LOCAL PROCESSING INFORMATION (OCLC)
l mnait
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type 20-AIT Publication
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type 22-AIT Thesis (Replacement)
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type 40-Archives
909 ## - LOCAL ITEMS USED
Barcode Barcode : 30050120905681
CREATED CREATED : 2006-01-13
RECORD Id RECORD # : i12471203
LPATRON LPATRON : 1018146
LCHKIN LCHKIN : 2009-03-14
RENEWALS # RENEWALS : 0
-- # OVERDUE : 0
-- IUSE3 : 1
-- TOT CHKOUT : 6
-- TOT RENEW : 2
909 ## - LOCAL ITEMS USED
Barcode Barcode : 30050120594865
CREATED CREATED : 2012-08-16
RECORD Id RECORD # : i12687388
LPATRON LPATRON : 0
LCHKIN LCHKIN : -
RENEWALS # RENEWALS : 0
-- # OVERDUE : 0
-- IUSE3 : 0
-- TOT CHKOUT : 0
-- TOT RENEW : 0
909 ## - LOCAL ITEMS USED
Barcode Barcode : 30050160002456
CREATED CREATED : 2016-02-17
RECORD Id RECORD # : i1288375x
LPATRON LPATRON : 0
LCHKIN LCHKIN : -
RENEWALS # RENEWALS : 0
-- # OVERDUE : 0
-- IUSE3 : 0
-- TOT CHKOUT : 0
-- TOT RENEW : 0
909 ## - LOCAL ITEMS USED
Barcode Barcode : 30050121006182
CREATED CREATED : 2021-05-02
RECORD Id RECORD # : i13320865
LPATRON LPATRON : 0
LCHKIN LCHKIN : -
RENEWALS # RENEWALS : 0
-- # OVERDUE : 0
-- IUSE3 : 1
-- TOT CHKOUT : 0
-- TOT RENEW : 0
Holdings
Withdrawn status Lost status Damaged status Not for loan Home library Current library Shelving location Date acquired Cost, normal purchase price Total checkouts Full call number Barcode Date last seen Copy number Price effective from Koha item type
      Available for Loans Asian Institute of Technology Library Asian Institute of Technology Library AIT Publications 18/08/2026 50.00   AIT Diss. no.ISE-05-02 30050120905681 18/08/2026 1 18/08/2026 20-AIT Publication
      Available for Loans Asian Institute of Technology Library Asian Institute of Technology Library Archives 18/08/2026     AIT Diss. no.ISE-05-02 30050120594865 18/08/2026 3 18/08/2026 22-AIT Thesis (Replacement)
      Available for Loans Asian Institute of Technology Library Asian Institute of Technology Library Archives 18/08/2026     AIT Diss. no.ISE-05-02 30050160002456 18/08/2026 1 18/08/2026 40-Archives
      Available for Loans Asian Institute of Technology Library Asian Institute of Technology Library AIT Publications 18/08/2026 50.00   AIT Diss. no.ISE-05-02 30050121006182 18/08/2026 2 18/08/2026 20-AIT Publication
คัดลอกแล้ว!