Business, general

Lot-sizing with start-up times

Article Abstract:

Manufacturers are sometimes required to make lot-sizing and scheduling decisions in the presence of start-up times. A study was conducted to investigate a single-stage multi-item single-mode production lot-sizing and scheduling model with continuous set-ups and sequence-independent start-up times. The solution of the problem was performed through an integer programming column generation algorithm. The single-item subproblem that considers the initial stock as a decision variable was tackled with a dynamic programming procedure. The multi-item polyhedra was addressed through Constantino's cutting planes. Pre-branching lower bounds averaged under 2% from an optimal solution though column and cut generation. The algorithm was able to handle instances with three to five items and 24 periods in an average of 50 seconds on a new workstation. The algorithm also solved 36-period problems in an average of 750 seconds.

Author: Vanderbeck, Francois

Publisher:Institute for Operations Research and the Management SciencesPublication Name:Management ScienceSubject:Business, generalISSN:0025-1909Year:1998

Production management

User Contributions:

Comment about this article or add new information about this topic:

Public Comment:&nbsp (50-4000 characters)

Name:

E-mail:

Type the code shown:

Show my email publicly:

Optimal cycle times in multistage serial systems with set-up and inventory costs

Article Abstract:

The problem of scheduling serial multistage production systems when there is a constant demand rate and infinite horizon is analyzed. A general nonlinear programming formulation is introduced for generating optimal stationary schedules with no stock-outs in any inventory in serial systems with set-up and inventory costs. Analytical results are used to formulate four algorithms, three of which are heuristic and one branch and bound. An assessment of the performance of these algorithms shows that the branch and bound algorithm is superior to the hueristic algorithms.

Author: Karimi, Iftekhar A.

Publisher:Institute for Operations Research and the Management SciencesPublication Name:Management ScienceSubject:Business, generalISSN:0025-1909Year:1992