Abstract
Abstract This work empirically evaluates the “entrapment” procedure used by Barnes and Brennan's branch-and-bound algorithm to minimize total cost of tardy jobs to be processed on identical machines. Using 25 problems taken from various known sources, it is shown that entrapment does not necessarily decrease computational time required to optimally solve such a problem.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
