IIMA Institutional Repository
This Institutional Repository has been created to collect, preserve and distribute the scholarly output of Indian Institute of Management, Ahmedabad. This will work as an important tool to facilitate scholarly communication and preserve the institution knowledge. The Vikram Sarabhai Library is proud to be hosting the repository for the dissemination and preservation of this valuable knowledge resource of the IIMA community.
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11718/1794Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Sastry, S. Trilochan | |
| dc.date.accessioned | 2010-03-29T09:17:24Z | |
| dc.date.available | 2010-03-29T09:17:24Z | |
| dc.date.copyright | 1991-11 | |
| dc.date.issued | 2010-03-29T09:17:24Z | |
| dc.identifier.uri | http://hdl.handle.net/11718/1794 | |
| dc.description.abstract | We study a scheduling problem with changeover costs and capacity constraints. The problem is NP-complete and combinatorial algorithms have not been very successful. We identify a general class of facets which subsumes as a special case all facets described earlier. We also develop a cutting plane based procedure for the dynamic version of the problem, and solve problem instances with up to 1200 integer variables to optimality without resorting to branch and bound procedures. | en |
| dc.language.iso | en | en |
| dc.relation.ispartofseries | WP;1991/987 | |
| dc.subject | lot-sizing problem | |
| dc.title | Valid inequalities and facets for the capacitated lot-sizing problem with changeover costs | en |
| dc.type | Working Paper | en |
| Appears in Collections: | Working Papers | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| WP 1991_987.pdf | 1.89 MB | Adobe PDF | View/Open |
Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.