1 resultado para CLOSED SUBSETS
em Digital Peer Publishing
Filtro por publicador
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (1)
- Aquatic Commons (7)
- Archive of European Integration (2)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (4)
- Aston University Research Archive (10)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (5)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (11)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (27)
- Boston University Digital Common (1)
- Brock University, Canada (5)
- Bucknell University Digital Commons - Pensilvania - USA (3)
- Bulgarian Digital Mathematics Library at IMI-BAS (9)
- CaltechTHESIS (2)
- Cambridge University Engineering Department Publications Database (48)
- CentAUR: Central Archive University of Reading - UK (27)
- Center for Jewish History Digital Collections (8)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (15)
- Cochin University of Science & Technology (CUSAT), India (4)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (1)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (2)
- CUNY Academic Works (7)
- Department of Computer Science E-Repository - King's College London, Strand, London (2)
- Digital Commons @ DU | University of Denver Research (1)
- Digital Commons @ Winthrop University (1)
- Digital Commons at Florida International University (1)
- Digital Peer Publishing (1)
- DigitalCommons@The Texas Medical Center (3)
- DRUM (Digital Repository at the University of Maryland) (1)
- Duke University (5)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (29)
- FUNDAJ - Fundação Joaquim Nabuco (1)
- Glasgow Theses Service (1)
- Greenwich Academic Literature Archive - UK (1)
- Helda - Digital Repository of University of Helsinki (38)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Indian Institute of Science - Bangalore - Índia (137)
- Institutional Repository of Leibniz University Hannover (1)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Massachusetts Institute of Technology (1)
- National Center for Biotechnology Information - NCBI (9)
- Publishing Network for Geoscientific & Environmental Data (5)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (39)
- Queensland University of Technology - ePrints Archive (333)
- RCAAP - Repositório Científico de Acesso Aberto de Portugal (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (1)
- Repositório Digital da UNIVERSIDADE DA MADEIRA - Portugal (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (44)
- Repositorio Institucional Universidad EAFIT - Medelin - Colombia (1)
- School of Medicine, Washington University, United States (3)
- Scielo España (1)
- Universidad de Alicante (2)
- Universidad Politécnica de Madrid (10)
- Universitat de Girona, Spain (1)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (2)
- Université de Montréal (1)
- Université de Montréal, Canada (2)
- University of Michigan (28)
- University of Queensland eSpace - Australia (11)
- University of Washington (1)
Resumo:
We present a new model formulation for a multi-product lot-sizing problem with product returns and remanufacturing subject to a capacity constraint. The given external demand of the products has to be satisfied by remanufactured or newly produced goods. The objective is to determine a feasible production plan, which minimizes production, holding, and setup costs. As the LP relaxation of a model formulation based on the well-known CLSP leads to very poor lower bounds, we propose a column-generation approach to determine tighter bounds. The lower bound obtained by column generation can be easily transferred into a feasible solution by a truncated branch-and-bound approach using CPLEX. The results of an extensive numerical study show the high solution quality of the proposed solution approach.