The current paper presents a structured overview over the literature on dynamic simultaneous lotsizing and scheduling problems. We introduce a classification scheme, review the historical development of research in this area and identify recent developments. The main contribution of the present review is the discussion of the historical development of the body of knowledge in the field of simultaneous lotsizing and scheduling and the identification of recent trends. This helps to reveal research opportunities, but it can also be helpful in the selection of appropriate models for industrial applications.

Simultaneous lotsizing and scheduling problems: a classification and review of models

A new model is presented for capacitated lot-sizing with sequence dependent setup costs. The model is solved heuristically with a backward oriented method; the sequence and lot-size decisions are based on a priority rule which consists of a convex combination of setup and holding costs. A computational study is performed where the heuristic is compared with the Fleischmann approach for the discrete lot-sizing and scheduling problem with sequence dependent setup costs.

Capacitated lot-sizing with sequence dependent setup costs

This study presents a review of optimization models for tactical production planning. The objective of this research is to identify streams and future research directions in this field based on the different classification criteria proposed. The major findings indicate that: (1) the most popular production-planning area is master production scheduling with a big-bucket time-type period; (2) most of the considered limited resources correspond to productive resources and, to a lesser extent, to inventory capacities; (3) the consideration of backlogs, set-up times, parallel machines, overtime capacities and network-type multisite configuration stand out in terms of extensions; (4) the most widely used modelling approach is linear/integer/mixed integer linear programming solved with exact algorithms, such as branch-and-bound, in commercial MIP solvers; (5) CPLEX, C and its variants and Lindo/Lingo are the most popular development tools among solvers, programming languages and modelling languages, respectively...

/pdf/a-review-of-discrete-time-optimization-models-for-tactical-237st363ml.pdf

A review of discrete-time optimization models for tactical production planning

Modeling lotsizing and scheduling problems with sequence dependent setups

Single-stage formulations for synchronised two-stage lot sizing and scheduling in soft drink production

In production planning, sequence dependent setup times and costs are often incurred for switchovers from one product to another. When setup times and costs do not respect the triangular inequality, a situation may occur where the optimal solution includes more than one batch of the same product in a single period--in other words, at least one sub tour exists in the production sequence of that period. By allowing setup crossovers, flexibility is increased and better solutions can be found. In tight capacity conditions, or whenever setup times are significant, setup crossovers are needed to assure feasibility. We present the first linear mixed-integer programming extension for the capacitated lot-sizing and scheduling problem incorporating all the necessary features of sequence sub tours and setup crossovers. This formulation is more efficient than other well known lot-sizing and scheduling models.

/pdf/capacitated-lot-sizing-and-scheduling-with-sequence-1h7ibgh12i.pdf

António Aroso Menezes

Papers

Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups