Skip to main content

A Novel Matrix Approach to Determine Makespan for Zero-Wait Batch Processes

  • Chapter
Book cover Advances in Industrial Engineering and Operations Research

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 5))

  • 2149 Accesses

Scheduling zero-wait batch processes involves various parameters of which makespan is normally used as the deciding parameter for selecting the optimum production sequence. Most of the currently available methods for determining makespan are based on complex mathematical programming techniques. The current research focuses on developing a novel method to determine makespan for zero-wait batch processes using simple mathematics coupled with some rule-based guidelines to be performed on a matrix containing the batch process recipes. The method is reasonably efficient and gives promising results with different batch process recipes.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jun-Hyung Ryu and Efstratios N. Pistikopoulos (2007) A novel approach to scheduling of zero-wait batch processes under processing time variations. Computers and Chemical Engineering, 31: 101-106.

    Article  Google Scholar 

  2. J. Balasubramanian and I.E. Grossmann (2002) A novel branch and bound algorithm for scheduling flowshop plants with uncertain processing times. Computers and Chemical Engineering, 26: 41-57.

    Article  Google Scholar 

  3. V. Caraffa, S. Ianes, T.P. Bagchi, and C. Sriskandarajah (2001) Minimizing makespan in a blocking flowshop using genetic algorithms. International Journal of Production Economics, 70: 101-115.

    Article  Google Scholar 

  4. L. Dupont and C. Dhaenens-Flipo (2002) Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure. Computers and Operations Research, 29: 807-819.

    Article  MATH  MathSciNet  Google Scholar 

  5. J. Jung, H. Lee, D. Yang, and I. Lee (1994) Completion times and optimal scheduling for serial multi-product processes with transfer and set-up times in zero-wait policy. Computers and Chemical Engineering, 6: 537-544.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Shafeeq, A., Mutalib, M.I.A., Amminudin, K.A., Muhammad, A. (2008). A Novel Matrix Approach to Determine Makespan for Zero-Wait Batch Processes. In: Chan, A.H.S., Ao, SI. (eds) Advances in Industrial Engineering and Operations Research. Lecture Notes in Electrical Engineering, vol 5. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74905-1_11

Download citation

Publish with us

Policies and ethics