A Mixed Integer Programming Model for Lot Sizing and Sequencing Packaging Lines in the Process Industries

1 September 1986

journal article
research article
Published by Informa UK Limited in IIE Transactions

Vol. 18 (3), 278-285
https://doi.org/10.1080/07408178608974705

Abstract

A mixed integer 0-1 programming formulation for the lot sizing and sequencing of packaging lines in process industries is presented. Results of tests of the model under a variety of operating conditions are listed and it is illustrated that the model may be useful for the solution of smaller practical problems. Implications are discussed for the development of heuristics that may be used to solve large problems.

Keywords

This publication has 19 references indexed in Scilit:

The Joint Replenishment Problem with a Powers-of-Two Restriction
IIE Transactions, 1985
Flexible Mixed-Integer Programming Formulations for Production Scheduling Problems
IIE Transactions, 1985
Joint Inventory Replenishments with Group Discounts Based on Invoice Value
Management Science, 1984
Coordinating order cycles under joint replenishments of multi‐item inventories
Naval Research Logistics Quarterly, 1984
Computational Complexity of the Capacitated Lot Size Problem
Management Science, 1982
A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up Costs
Operations Research, 1979
The Economic Lot Scheduling Problem (ELSP): Review and Extensions
Management Science, 1978
Determination of Optimum Packaging Frequency of Items Jointly Replenished
Management Science, 1974
Determination of Economic Packaging Frequency for Items Jointly Replenished
Management Science, 1973
Technical Note—Economic Packaging Frequency for Items Jointly Replenished
Operations Research, 1973

Cited by 18 articles