Metaheuristics based on Bin Packing for the line balancing problem

Author： Gourgand Michel Grangeon Nathalie Norre Sylvie

E-ISSN： 1290-3868|41|2|193-211

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.41, Iss.2, 2007-06, pp. : 193-211

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

Abstract

Related content

Algorithms for the two dimensional bin packing problem with partial conflicts

By Hamdi-Dhaoui Khaoula Labadie Nacima Yalaoui Alice

RAIRO - Operations Research, Vol. 46, Iss. 1, 2012-05 ,pp. : 41-62

Edp Sciences

Access to resources Recommend Favorite

Online LIB problems: Heuristics for Bin Covering and lower boundsfor Bin Packing

By Finlay Luke Manyem Prabhu

RAIRO - Operations Research, Vol. 39, Iss. 3, 2006-01 ,pp. : 163-183

Edp Sciences

Access to resources Recommend Favorite

The Biospheric Packing Problem

Ecology, Vol. 51, Iss. 1, 1970-01 ,pp. : 1-1

John Wiley & Sons Inc

Access to resources Recommend Favorite

A note on dual approximation algorithms for class constrained bin packing problems

By Xavier Eduardo C. Miyazawa Flàvio Keidi

RAIRO - Theoretical Informatics and Applications, Vol. 43, Iss. 2, 2008-10 ,pp. : 239-248

Edp Sciences

Access to resources Recommend Favorite

An AHP and PROMETHEE methods-based environment friendly heuristic for disassembly line balancing problems

By Avikal Shwetank

Interdisciplinary Environmental Review, Vol. 14, Iss. 1, 2013-05 ,pp. : 69-85

Inderscience Publishers

Access to resources Recommend Favorite