Skip to main content
SpringerLink
Log in

Order consolidation for hierarchical product lines

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

We consider the batch production of hierarchical product lines in raw material industry where the whole or parts of multiple customer orders may be consolidated and processed in the same batch if their product specifications are compatible. The objective of the problem is to find maximum possible number of batches completely filled up to their capacity. The compatibility relationship among product specifications is represented by a graph called the compatibility graph. If the compatibility graph is an arbitrary graph, the problem is proven to be NP-hard and belongs to Max SNP-hard class. We develop an optimum algorithm for an important subclass of the problem where the graph is a quasi-threshold graph which in fact is the case for producing hierarchical product lines that are often found in raw materials industry.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  • Chang SY, Chang MR, Hong YS (2000) A lot grouping algorithm for a continuous slab caster in an integrated steel mill. Prod Plan Control 11:363–368

    Article  Google Scholar 

  • Chang J, Chang SY, Hong S-P, Min Y-H, Park M-J (2010) Approximation of a batch consolidation problem. Networks. doi:10.1002/net.20409

    Google Scholar 

  • Chu FPM (2008) A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements. Inf Process Lett 107:7–12

    Article  MATH  Google Scholar 

  • Guruswami V, Pandu Rangan C, Chang MS, Chang GJ, Wong CK (2001) The K r -packing problem. Computing 66:79–89

    Article  MATH  MathSciNet  Google Scholar 

  • Hong S-P, Park M-J, Chang SY (2009) Approximation of the k-batch consolidation problem. Theor Comput Sci 410:963–967

    Article  MATH  MathSciNet  Google Scholar 

  • Hwang H-C, Chang SY (2005) Order consolidation for batch processing. J Comb Optim 9:121–138

    Article  MATH  MathSciNet  Google Scholar 

  • Lee K, Chang SY, Hong YS (2004) Continuous slab caster scheduling and interval graphs. Prod Plan Control 15(5):495–501

    Article  Google Scholar 

  • Tang L, Liu J, Ring A, Yang Z (2001) A review of planning and scheduling systems and methods for integrated steel production. Eur J Oper Res 133:1–20

    Article  MATH  Google Scholar 

  • Yan J-H, Chen J-J, Chang GJ (1996) Quasi-threshold graphs. Discrete Appl Math 69:247–255

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial and Management Engineering, Pohang University of Science and Technology, San 31 Hyoja-Dong, Pohang, Kyungbuk, 790-784, Republic of Korea

    Woo-Lahm Kwak & Soo Y. Chang

Authors
  1. Woo-Lahm Kwak
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Soo Y. Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Soo Y. Chang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kwak, WL., Chang, S.Y. Order consolidation for hierarchical product lines. J Comb Optim 27, 597–608 (2014). https://doi.org/10.1007/s10878-012-9538-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-012-9538-z

Keywords

Search

Navigation