Skip to main content
Log in

A cyclic production scheme for the synchronized and integrated two-level lot-sizing and scheduling problem with no-wait restrictions and stochastic demand

  • Regular Article
  • Published:
OR Spectrum Aims and scope Submit manuscript

Abstract

In this paper, we propose a production scheme for a two-step packaging system as part of a make-and-pack production process including parallel production units in all stages. In the first stage of the packaging system, flavored liquids are filled into cans of different sizes which are immediately palletized in the second stage, i.e., work-in-progress inventories do not exist. However, each filling unit can feed more than one palletizer at a time. Final products can be stored in a warehouse with limited capacity. Among others, the proposed scheme consists of a periodic production sequence, also referred to as a cycle, for each production unit and a control strategy that keeps cycle lengths close to a target length. In addition, an approach to specifying the parameters of the scheme is developed. This approach accounts for sequence-dependent setup times, downtimes of production units, capacitated storage and uncertain demand for final products that is satisfied from stock or backlogged. We evaluate our approach conducting computational experiments that are based on real-world and random data.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  • Akkerman R, van Donk DP (2007) Product prioritization in a two-stage food production system with intermediate storage. Int J Prod Econ 108:43–53

    Article  Google Scholar 

  • Almada-Lobo B, Oliveira JF, Carravilla MA (2008) Production planning and scheduling in the glass container industry: a VNS approach. Int J Prod Econ 114:363–375

    Article  Google Scholar 

  • Amin M, Altiok T (1997) Control policies for multi-product multi-stage manufacturing systems: an experimental approach. Int J Prod Res 35:201–223

    Article  Google Scholar 

  • Baldo TA, Santos MO, Almada-Lobo B, Morabito R (2014) An optimization approach for the lot sizing and scheduling problem in the brewery industry. Comput Ind Eng 72:58–71

    Article  Google Scholar 

  • Baumann P, Trautmann N (2014) A hybrid method for large-scale short-term scheduling of make-and-pack production processes. Eur J Oper Res 236:718–735

    Article  Google Scholar 

  • Belaid R, T’kindt V, Esswein C (2012) Scheduling batches in flowshop with limited buffers in the shampoo industry. Eur J Oper Res 223:560–572

    Article  Google Scholar 

  • Bourland KE, Yano CA (1994) The strategic use of capacity slack in the economic lot scheduling problem with random demand. Manag Sci 40:1690–1704

    Article  Google Scholar 

  • Bowersox DJ (1978) Logistical management. Collier Macmillan Ltd, London

    Google Scholar 

  • Brandimarte P (2006) Multi-item capacitated lot-sizing with demand uncertainty. Int J Prod Res 44:2997–3022

    Article  Google Scholar 

  • Briskorn D, Zeise P, Packowski J (2016) Quasi-fixed cyclic production schemes for multiple products with stochastic demand. Eur J Oper Res 252:156–169

    Article  Google Scholar 

  • Erdirik-Dogan M, Grossmann IE (2008) Slot-based formulation for the short-term scheduling of multistage, multiproduct batch plants with sequence-dependent changeovers. Ind Eng Chem Res 47:1159–1183

    Article  Google Scholar 

  • Federgruen A, Katalan Z (1996) The stochastic economic lot scheduling problem: cyclical base-stock policies with idle times. Manag Sci 36:1579–1592

    Google Scholar 

  • Ferreira D, Morabito R, Rangel S (2009) Solution approaches for the soft drink integrated production lot sizing and scheduling problem. Eur J Oper Res 196:697–706

    Article  Google Scholar 

  • Gallego G (1990) Scheduling the production of several items with random demands in a single facility. Manag Sci 36:1579–1592

    Article  Google Scholar 

  • Gelders LF, van Wassenhove LN (1981) Production planning: a review. Eur J Oper Res 7:101–110

    Article  Google Scholar 

  • Günther HO, Grunow M, Neuhaus U (2006) Realizing block planning concepts in make-and-pack production using MILP modelling and SAP APO®. Int J Prod Res 44:3711–3726

    Article  Google Scholar 

  • Kallrath J (2005) Solving planning and design problems in the process industry using mixed integer and global optimization. Ann Oper Res 140:339–373

    Article  Google Scholar 

  • Kopanos GM, Méndez CA, Puigjaner L (2010) Mip-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: a benchmark scheduling problem of the pharmaceutical industry. Eur J Oper Res 207:644–655

    Article  Google Scholar 

  • Kopanos GM, Puigjaner L, Georgiadis MC (2011) Production scheduling in multiproduct multistage semicontinuous food processes. Ind Eng Chem Res 50:6316–6324

    Article  Google Scholar 

  • Laporte G (1992) The traveling salesman problem: an overview of exact and approximate algorithms. Eur J Oper Res 59:231–247

    Article  Google Scholar 

  • Mehrotra M, Dawande M, Gavirneni S, Demirci M, Tayur S (2011) Production planning with patterns: a problem from processed food manufacturing. Oper Res 59:267–282

    Article  Google Scholar 

  • Méndez CA, Cerdá J (2002) An MILP-based approach to the short-term scheduling of make-and-pack continuous production plants. OR Spectr 24:403–429

    Article  Google Scholar 

  • Méndez CA, Cerdá J, Grossmann IE, Harjunkoski I, Fahl M (2006) State-of-the-art review of optimization methods for short-term scheduling of batch processes. Comput Chem Eng 30:913–946

    Article  Google Scholar 

  • Raaymakers W, Hoogeveen J (2000) Scheduling multipurpose batch process industries with no-wait restrictions by simulating annealing. Eur J Oper Res 126:131–151

    Article  Google Scholar 

  • Rappold JA, Yoho KD (2014) Setting safety stocks for stable rotation cycle schedules. Int J Prod Econ 156:146–158

    Article  Google Scholar 

  • Ruiz R, Maroto C (2006) A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. Eur J Oper Res 169:781–800

    Article  Google Scholar 

  • Sammarra M, Cordeau J-F, Laporte G, Monaco MF (2007) A tabu search heuristic for the quay crane scheduling problem. J Sched 10:327–336

    Article  Google Scholar 

  • Sharda B, Akiya N (2012) Selecting make-to-stock and postponement policies for different products in a chemical plant: a case study using discrete event simulation. Int J Prod Econ 136:161–171

    Article  Google Scholar 

  • Silver E, Pyke D, Peterson R (1998) Inventory management and production planning and scheduling. Wiley, London

    Google Scholar 

  • Soman CA, van Donk DP, Gaalman GJC (2007) Capacitated planning and scheduling for combined make-to-order and make-to-stock production in the food industry: an illustrative case study. Int J Prod Econ 108:191–199

    Article  Google Scholar 

  • Toledo CFM, França PM, Morabito R, Kimms A (2009) Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem. Int J Prod Res 47:3097–3119

    Article  Google Scholar 

  • Toledo CFM, da Silva Arantes M, França PM (2011) Tabu search to solve the synchronized and integrated two-level lot sizing and scheduling problem. In: Proceedings of the 13th annual conference on genetic and evolutionary computation. ACM, pp 443–448

  • van Dam P, Gaalman GJC, Sierksma G (1998) Designing scheduling systems for packing in process industries: a tobacco company case. Int J Prod Econ 56–57:649–659

    Google Scholar 

  • van Donk DP (2001) Make to stock or make to order: the decoupling point in the food processing industries. Int J Prod Econ 69:297–306

    Article  Google Scholar 

  • Vaughan TS (2007) Cyclical schedules vs. dynamic sequencing:replenishment dynamics and inventory efficiency. Int J Prod Econ 107:518–527

    Article  Google Scholar 

  • Vaughan TS (2009) Alternative control mechanisms for cyclical scheduling systems. Int J Prod Res 47:6321–6332

    Article  Google Scholar 

  • Venditti L, Pacciarelli D, Meloni C (2010) A tabu search algorithm for scheduling pharmaceutical packaging operations. Eur J Oper Res 202:538–546

    Article  Google Scholar 

  • Wirtz BW (2007) Handbuch multi-channel-marketing. Gabler

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Philipp Zeise.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendices

System properties and assumptions

See Table 4.

Table 4 Overview of the production system

Make-and-pack systems discussed in the literature

Table 5 Overview of the literature

Table 5 gives an overview of contributions on make-and-pack systems in the literature and the characteristics of the production planning problem considered in the paper at hand. For each of the relevant papers, it outlines what characteristics each of these contributions takes into account.

As mentioned in Sect. 1, demand is assumed to be deterministic in contributions that consider parallel packaging units. Vice versa, contributions that investigate production environments with a stochastic demand for final products focus on a serial supply chain. In most cases, stages are decoupled by a storage location facilitating synchronization of production and packaging processes. Furthermore, demand and supply of final products is decoupled by a storage location for final products. Sequence-dependent setup times are also part of most of the examined production environments whereas unit downtimes are only considered by Venditti et al. (2010). Remember that Briskorn et al. (2016), Rappold and Yoho (2014) and Vaughan (2009) focus on a single production unit.

A hierarchical framework comprising both a planning phase (production scheme) and an execution phase (detailed scheduling according to the scheme) combined with cyclic patterns is proposed only in a minority of contributions. Among these contributions, Günther et al. (2006), Rappold and Yoho (2014) and Vaughan (2009) consider a pure (P) rotation sequence, whereas Mehrotra et al. (2011), Soman et al. (2007), Bourland and Yano (1994) and Briskorn et al. (2016) propose a general (G) production sequence.

Nomenclature

\(a_{(i,j)}\) :

Number of units of intermediate i necessary to produce one unit of SKU (ij)

\(\alpha _{(i,j)}\) :

Minimum service level of SKU (ij)

\(\alpha _{(i,j)}^r\) :

Service level of SKU (ij) observed in simulation run r

C :

Total available storage space for SKUs

\(C^{+}\) :

Median of the SR values of the additional storage space requirement found by simulation

\(C^{+^r}\) :

Additional storage space requirement observed in simulation run r

\(CL_z\) :

Target cycle length of subsystem z

\({\overline{CL}}_z\) :

Average cycle length of subsystem z divided by the number of sections \(NC_z\) in subsystem z

\(\epsilon \) :

Parameter that defines the maximum permissible deviation of the cycle length from the target cycle length

\(\eta ^m_{(m,(i,j))}\) :

Median of the SR values of the average production cutback at the mth PR of SKU (ij) found by simulation

\(\eta ^r_{(m,(i,j))}\) :

Amount by which the mth PR of SKU (ij) is cut short on average in simulation run r

\(F_g\) :

Frequency of group g

\(F_{(i,j)}\) :

Frequency of SKU (ij)

FU :

Set of filling units

\({\overline{FU}}\) :

Set of correlated filling units

\(FU_i\) :

Set of filling units that can handle a PR of intermediate i

\({\tilde{FU}}_g\) :

Set of filling units that can handle the PR of an intermediate that is related group g

\({\hat{FU}}_z\) :

Set of filling units in subsystem z

G :

Set of groups of SKUs

\(h_{(i,j)}\) :

Inventory holding costs of SKU (ij) per pallet and hour

I :

Set of intermediates

\(IJ_g\) :

Set of SKUs forming group g

\(IJ_{i,s}\) :

Set of SKUs that are based on intermediate i with a PR of i being assignable to the set s of suitable filling units

\(I{\hat{J}}_z\) :

Set of SKUs that are an element of subsystem z

IC :

Median of the SR values of average inventory holding costs found by simulation

\(IC^{*}\) :

Average inventory holding costs observed for the best candidate scheme found

\(IC^r\) :

Average inventory holding costs observed in simulation run r

J :

Set of SKUs

\(J^{f}\) :

Set that contains SKU \((i,j) \in I{\hat{J}}_z\) if \(NC_z\ /\ F_{(i,j)} = f\) with \(z=1,\ldots ,Z\)

\(\lambda _{(i,j)}\) :

Demand rate of SKU (ij)

\(LB_{(m,(i,j))}\) :

Minimum lot size for the mth PR of SKU (ij)

M :

Big number

\(NC_z\) :

Number of sections in subsystem z

\(\omega _{(i,j)}\) :

Standard deviation of demand of SKU (ij)

\(\Omega _{(i,j)}\) :

Parameter that defines the maximum permissible deviation from the average lot size for a PR of SKU (ij)

P :

Simulated period

\(\pi _{(i,j),u}\) :

Maximum packaging rate of SKU (ij) on packaging unit u

\(\pi _{i,u}\) :

Maximum filling rate of intermediate i on filling unit u

PU :

Set of packaging units

\(PU_{(i,j)}\) :

Set of packaging units that can handle a PR of SKU (ij)

\(PU_{(i,j),u}\) :

Set of packaging units that can handle a PR of SKU (ij) and can be fed from filling unit u

\(PU_u\) :

Set of packaging units that can be fed from filling unit u

\(q_{(m,(i,j))}\) :

Lot size for the mth PR of SKU (ij)

\({\overline{q}}_{(m,(i,j))}\) :

Expected lot size for the mth PR of SKU (ij)

\(\rho _{g,u}\) :

Utilization rate of group g if the corresponding intermediate is produced on filling unit u

\(\rho _{(i,j),u}\) :

Utilization rate of SKU (ij) on packaging unit u

\(RP_{(m,(i,j))}\) :

Risk period for the mth PR of SKU (ij)

s :

Set of suitable filling units

\(S_{(m,(i,j))}\) :

Base-stock level for the mth PR of SKU (ij)

sf :

Safety factor

\(SI_u\) :

Sequence of PRs on filling unit u

\({\overline{\sigma }}_{CL_z}\) :

Standard deviation of the cycle length of subsystem z divided by the number of sections \(NC_z\)

SR :

Number of simulation runs

\(st_{(m,(i,j))}\) :

Safety stock level assumed to be available in \(t_{(m,(i,j))}\)

\(t_{(m,(i,j))}\) :

Expected time between the beginning of the mth and the beginning of the next PR of (ij)

\(TS_u\) :

Total setup time on unit u

\(\theta _u\) :

Downtime rate of unit u

\(UB_{(m,(i,j))}\) :

Maximum lot size for the mth PR of SKU (ij)

x :

Base value for determination of lot size boundaries

Z :

Number of subsystems

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Briskorn, D., Zeise, P. A cyclic production scheme for the synchronized and integrated two-level lot-sizing and scheduling problem with no-wait restrictions and stochastic demand. OR Spectrum 41, 895–942 (2019). https://doi.org/10.1007/s00291-019-00555-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00291-019-00555-y

Keywords

Navigation