A new upper bound for routing problem with due date

P. Saksuriya; C. Likasiri

Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/67758

Full metadata record

DC Field	Value	Language
dc.contributor.author	P. Saksuriya	en_US
dc.contributor.author	C. Likasiri	en_US
dc.date.accessioned	2020-04-02T15:02:56Z	-
dc.date.available	2020-04-02T15:02:56Z	-
dc.date.issued	2019-01-01	en_US
dc.identifier.issn	21648689	en_US
dc.identifier.other	2-s2.0-85079511668	en_US
dc.identifier.uri	https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85079511668&origin=inward	en_US
dc.identifier.uri	http://cmuir.cmu.ac.th/jspui/handle/6653943832/67758	-
dc.description.abstract	© 2019, Computers and Industrial Engineering. All rights reserved. This research addresses the routing problem (RP) where the customer in each node has a due date, making it an extension of the classic routing problem. The objective function is to find a route that minimizes the number of nodes with tardiness. We transform RP into a scheduling problem with the processing time of a job being dependent upon the job preceding it. We propose a heuristic procedure to find an upper bound for branch and bound algorithm. Ten generated instances of 10, 12 and 15 jobs are given. The results demonstrate that the initial upper bound is efficient in reducing the branching processes.	en_US
dc.subject	Computer Science	en_US
dc.subject	Engineering	en_US
dc.title	A new upper bound for routing problem with due date	en_US
dc.type	Conference Proceeding	en_US
article.title.sourcetitle	Proceedings of International Conference on Computers and Industrial Engineering, CIE	en_US
article.volume	2019-October	en_US
article.stream.affiliations	Chiang Mai University	en_US
article.stream.affiliations	Centre of Excellence in Mathematics	en_US
Appears in Collections:	CMUL: Journal Articles

Files in This Item:

There are no files associated with this item.

Show simple item record