Formulations for the multi-item lot sizing problem with joint replenishments: some extensions

The Digital Institutional Repository of IIM Bangalore

Please use this identifier to cite or link to this item: https://repository.iimb.ac.in/handle/123456789/616

DC Field	Value	Language
dc.contributor.author	Rao, Arza Keshava	en_US
dc.date.accessioned	2012-07-26T11:27:41Z
dc.date.accessioned	2016-01-01T07:03:55Z
dc.date.accessioned	2019-05-27T08:41:52Z	-
dc.date.available	2012-07-26T11:27:41Z
dc.date.available	2016-01-01T07:03:55Z
dc.date.available	2019-05-27T08:41:52Z	-
dc.date.copyright	1992	en_US
dc.date.issued	1992
dc.identifier.other	WP_IIMB_17	-
dc.identifier.uri	http://repository.iimb.ac.in/handle/123456789/616	-
dc.description.abstract	A modified formulation of the multi-item lot sizing problem with joint replenishments is discussed. The new formulation results in the reduction in the number of constraints and consequently possible reduction in the computational effort. The formulation is extended to the case when there is an upper bound on the production for a given set up.
dc.language.iso	en	en_US
dc.publisher	Indian Institute of Management Bangalore	-
dc.relation.ispartofseries	IIMB Working Paper-17	-
dc.subject	Production management	-
dc.subject	Operations management	-
dc.subject	Multi-item lot sizing	-
dc.title	Formulations for the multi-item lot sizing problem with joint replenishments: some extensions	en_US
dc.type	Working Paper
dc.pages	8p.
Appears in Collections:	1992

File	Description	Size	Format
wp.iimb.17.pdf		622.38 kB	Adobe PDF	View/Open

Check