Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem

Author： Tercinet Fabrice Néron Emmanuel Lenté Christophe

ISSN： 1619-4500

Source： 4OR: Quarterly journal of the Belgian, French and Italian operations research societies, Vol.4, Iss.4, 2006-12, pp. : 297-317

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

A new destructive bounding scheme for the bin packing problem

By Jarboui Bassem

Annals of Operations Research, Vol. 179, Iss. 1, 2010-09 ,pp. : 187-202

Springer Publishing Company

Access to resources Recommend Favorite

Exact and approximate methods for a one-dimensional minimax bin-packing problem

By Brusco Michael

Annals of Operations Research, Vol. 206, Iss. 1, 2013-07 ,pp. : 611-626

Springer Publishing Company

Access to resources Recommend Favorite

A new heuristic algorithm for the one-dimensional bin-packing problem

By Gupta J. N. D. Ho J. C.

Production Planning and Control, Vol. 10, Iss. 6, 1999-09 ,pp. : 598-603

Taylor & Francis Ltd

Access to resources Recommend Favorite

On a parallel machine scheduling problem with precedence constraints

By Aho Isto Mäkinen Erkki

Journal of Scheduling, Vol. 9, Iss. 5, 2006-10 ,pp. : 493-495

Springer Publishing Company

Access to resources Recommend Favorite

Approximation algorithms for a hierarchically structured bin packing problem

By Codenotti B. De Marco G. Leoncini M. Montangero M. Santini M.

Information Processing Letters, Vol. 89, Iss. 5, 2004-03 ,pp. : 215-221

Elsevier

Access to resources Recommend Favorite