摘要:

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.

ISSN:0740-817X    

DOI:10.1080/05695558308974643

出版商:Taylor & Francis Group    

年代:1983

数据来源: Taylor

摘要:

Silver's algorithm for the joint replenishment problem is modified and improved. Computational requirements due to this modification are relatively very small. Extensive experimentation shows that the errors of Silver's algorithm can, on the average, be reduced by an order of magnitude.

ISSN:0740-817X    

DOI:10.1080/05695558308974644

出版商:Taylor & Francis Group    

年代:1983

数据来源: Taylor

摘要:

In a recent paper the first author developed a dynamic-programming-based heuristic for the two-dimensional pallet loading problem. This note presents improvements to that procedure which have resulted in reductions in CPU run times of up to 1/20, as well as drastic lowering of memory requirements. A fundamental improvement in the bounding function is developed, and another improvement taken from observations of real-world pallet loaders and furniture movers is presented. Other implications of the improvements are also discussed, and results are compared.

ISSN:0740-817X    

DOI:10.1080/05695558308974645

出版商:Taylor & Francis Group    

年代:1983

数据来源: Taylor

摘要:

This expository note reviews a somewhat neglected, but elementary, method for reformulating linear and convex cost production planning problems with inventory and back-order constraints as un-capacitated transportation-type problems.

ISSN:0740-817X    

DOI:10.1080/05695558308974646

出版商:Taylor & Francis Group    

年代:1983

数据来源: Taylor

ISSN:0740-817X    

DOI:10.1080/05695558308974647

出版商:Taylor & Francis Group    

年代:1983

数据来源: Taylor

ISSN:0740-817X    

DOI:10.1080/05695558308974648

出版商:Taylor & Francis Group    

年代:1983

数据来源: Taylor