✦ LIBER ✦

Establishing the optimality of sequencing heuristics for cutting stock problems

✍ Scribed by Boon J. Yuen; Ken V. Richardson

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 675 KB
Volume: 84
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(95)00025-l

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal solutions for the cutting stock

Optimal solutions for the cutting stock problem

✍ Constantine Goulimis 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 944 KB

A simulated annealing heuristic for the

A simulated annealing heuristic for the one-dimensional cutting stock problem

✍ Chuen-Lung S. Chen; Stephen M. Hart; Wai Mui Tham 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 949 KB

A note on the optimality of index priori

A note on the optimality of index priority rules for search and sequencing problems

✍ George J. Kyparisis; Christos Koulamas 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 74 KB

A comparison of optimization heuristics

A comparison of optimization heuristics for the data mapping problem

✍ Chrisochoides, Nikos; Mansour, Nashat; Fox, Geoffrey 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 421 KB 👁 2 views

In the paper we compare the performance of six heuristics with suboptimal solutions for the data distribution of two dimensional meshes that are used for the numerical solution of partial differential equations (PDEs) on multicomputers. The data mapping heuristics are evaluated with respect to seven

Worst-case analysis of heuristics for th

Worst-case analysis of heuristics for the local microcode optimization problem

✍ Axel Böttcher; Gisbert Lawitzky; Hans-Ulrich Simon 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 383 KB

A note on a proof of SPT optimality for

A note on a proof of SPT optimality for singlemachine sequencing problems via the transportation problem

✍ T.C.E. Cheng 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 139 KB