![A branch and bound algorithm to minimize the total tardiness for [An article from: European Journal of Operational Research]](https://www.ebooknetworking.net/books/B00/0P6/bigB000P6O3CK.jpg)
A branch and bound algorithm to minimize the total tardiness for [An article from: European Journal of Operational Research]
Book Details
Author(s)C.S. Chung, J. Flynn, O. Kirca
PublisherElsevier
ISBN / ASINB000P6O3CK
ISBN-13978B000P6O3C3
AvailabilityAvailable for download now
Sales Rank13,603,113
MarketplaceUnited States 🇺🇸
Description
This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2006. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
The m-machine permutation flowshop problem with the total tardiness objective is a common scheduling problem, which is known to be NP-hard. Here, we develop a branch and bound algorithm to solve this problem. Our algorithm incorporates a machine-based lower bound and a dominance test for pruning nodes. We undertake a numerical study that evaluates our algorithm and compares it with the best alternative existing algorithm. Extensive computational experiments indicate that our algorithm performs better and can handle test problems with n=
Description:
The m-machine permutation flowshop problem with the total tardiness objective is a common scheduling problem, which is known to be NP-hard. Here, we develop a branch and bound algorithm to solve this problem. Our algorithm incorporates a machine-based lower bound and a dominance test for pruning nodes. We undertake a numerical study that evaluates our algorithm and compares it with the best alternative existing algorithm. Extensive computational experiments indicate that our algorithm performs better and can handle test problems with n=
