Skip to main content
SpringerLink
Log in

The Multiple Batch Processing Machine Problem with Stage Specific Incompatible Job Families

  • Conference paper
  • First Online:
Dynamics in Logistics

Part of the book series: Lecture Notes in Logistics ((LNLO))

Abstract

This contribution introduces the problem of batching and scheduling n jobs in non-permutation flow shops with m ≥ 2 batch processing machines in sequence and stage specific incompatible job families. Batches are build at each stage according to family-specific parameters. This creates a stage-interdependent batching and scheduling problem. We formulate the model by considering different options in terms of release dates, due dates, objective functions as well as setup times and define a corresponding integer linear program.

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

Access this chapter

Log in via an institution
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 EPUB and 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

References

  • Allahverdi A (2008) A survey of scheduling problems with setup times or costs. Eur J Oper Res 187:985–1032

    Article  MathSciNet  MATH  Google Scholar 

  • Bixby R, Gu Z, Rothberg E (2012) Gurobi. URL http://www.gurobi.com. Accessed 12/03/16

  • Buscher U, Shen L (2009) MIP-based approaches for solving scheduling problems with batch processing machines. Oper Res 132–139

    Google Scholar 

  • Chiang T, Cheng H (2010) A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival. Comput Oper Res 37(12):2257–2269

    Article  MathSciNet  MATH  Google Scholar 

  • Fu Q, Sivakumar A, Li K (2011) Optimisation of flow-shop scheduling with batch processor and limited buffer. Int J Prod Res p Forthcoming article the multiple batch processing machine problem 11

    Google Scholar 

  • Garey MR, Johnson DS (1990) Computers and intractability; a guide to the theory of NP-completeness. W. H. Freeman & Co., New York

    Google Scholar 

  • Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1(2):117–129

    Article  MathSciNet  MATH  Google Scholar 

  • Glass CA, Potts CN, Strusevich VA (2001) Scheduling batches with sequential job processing for two-machine flow and open shops. INFORMS J Comput 13(2):120–137

    Article  MathSciNet  MATH  Google Scholar 

  • Graham RL, Lawler EL, Lenstra JK, Kan Rinnooy A (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287–326

    Google Scholar 

  • Jula P, Leachman R (2010) Coordinated multistage scheduling of parallel batch-processing machines under multiresource constraints. Oper Res 58(4-Part-1):933–947

    Google Scholar 

  • Kim Yd, Kim Jg, Choi B, Kim Hu (2001) Production scheduling in a semiconductor wafer fabrication facility producing multiple product types with distinct due dates. IEEE Trans Robot 17(5):589–598

    Article  Google Scholar 

  • Koh S, Koo P, Kim D, Hur W (2005) Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families. Int J Prod Econ 98(1):81–96

    Article  Google Scholar 

  • Kumar Manjeshwar P, Damodaran P, Srihari K (2009) Minimizing makespan in a flow shop with two batch-processing machines using simulated annealing. Robot Comput Integrated Manuf 25(3):667–679

    Article  Google Scholar 

  • Lei D, Guo XP (2011) Variable neighbourhood search for minimising tardiness objectives on flow shop with batch processing machines. Int J Prod Res 49(2):519–529

    Article  Google Scholar 

  • Mathirajan M, Sivakumar A (2006) A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor. Int J Adv Manuf Tech 29(9–10):990–1001

    Article  Google Scholar 

  • Ng CT, Kovalyov MY (2007) Batching and scheduling in a multi-machine flow shop. J Sched 10(6):353–364

    Article  MathSciNet  MATH  Google Scholar 

  • Potts C, Kovalyov M (2000) Scheduling with batching: a review. Eur J Oper Res 120(2):228–249

    Article  MathSciNet  MATH  Google Scholar 

  • Tajan JBC, Sivakumar AI, Gershwin SB (2006) Performance of a serial-batch processor system with incompatible job families under simple control policies. Mechanical Engineering (65), URL http://hdl.handle.net/1721.1/29835

  • Uzsoy R (1994) Scheduling a single batch processing machine with nonidentical job sizes. Int J Prod Res 32(7):1615–1635

    Article  MATH  Google Scholar 

  • Webster S, Baker KR (1995) Scheduling groups of jobs on a single machine. Oper Res 43(4):692–703

    Article  MathSciNet  MATH  Google Scholar 

  • Yao S, Jiang Z, Li N (2012) A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals. Comput Oper Res 39(5):939–951

    Article  MathSciNet  MATH  Google Scholar 

  • Yuan JJ, Liu ZH, Ng CT, Cheng TCE (2006) Single machine batch scheduling problem with family setup times and release dates to minimize makespan. J Sched 9(6):499–551

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Planning and Control of Production Systems, University of Bremen, Hochschulring 20, D 28359, Bremen, Germany

    Marc-Andrè Isenberg & Bernd Scholz-Reiter

Authors
  1. Marc-Andrè Isenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bernd Scholz-Reiter
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marc-Andrè Isenberg .

Editor information

Editors and Affiliations

  1. , Department of Computer Science, University of Bremen, Linzer Straße 9a, Bremen, 28359, Germany

    Hans-Jörg Kreowski

  2. Rector of the University of Bremen, Hochschulring 20, Bremen, 28359, Germany

    Bernd Scholz-Reiter

  3. Logistik (BIBA), Planung und Steuerung, Bremer Institut für Produktion und, Hochschulring 20, Bremen, 28359, Germany

    Klaus-Dieter Thoben

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Isenberg, MA., Scholz-Reiter, B. (2013). The Multiple Batch Processing Machine Problem with Stage Specific Incompatible Job Families. In: Kreowski, HJ., Scholz-Reiter, B., Thoben, KD. (eds) Dynamics in Logistics. Lecture Notes in Logistics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35966-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35966-8_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35965-1

  • Online ISBN: 978-3-642-35966-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation