Skip to main content

Advertisement

SpringerLink
Log in

Integration between flow scheduling and personnel allocation in a parallel line system in automotive industry

  • Forschung
  • Published:
Zeitschrift für Betriebswirtschaft Aims and scope Submit manuscript

Abstract

A state-of-the-art review over fifty years of flow shop scheduling research, written by Gupta and Stafford (2006), comes to the conclusion that the mathematical theory of flow shop scheduling “suffers from too much abstraction and too little application”. In this paper we will develop an extended mathematical model for flow shop scheduling with parallel lines and simultaneously a worker assignment to machines as well as a solution concept for practical use. Such production systems are realized by applying the BTO-(Build to order) concept, as can be found in the automotive or computer industry, which allows customers to make any changes to their vehicles or hardware configuration within a few days before final assembly. In these cases late configuration is an important task for the producer and a complex scheduling problem arises in this context.

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
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  • Burkard R, Dell’Amico M, Martello S (2009) Assignment problems. SIAM, Philadelphia

    Book  Google Scholar 

  • Camm J, Magazine MJ, Polak GP, Zaric GS (2008) Scheduling parallel assembly workstations to minimize a shared pool of labor. IIE Trans 40:749–758

    Article  Google Scholar 

  • Campbell GM, Diaby M (1998) Development and evaluation of an assignment heuristic for allocating cross-trained workers. Eur J Oper Res 138(1):9–20

    Article  Google Scholar 

  • Cattrysse DG, Van Wassenhove L (2002) A survey of algorithms for the generalized assignment problem. Eur J Oper Res 60(3):260–272

    Article  Google Scholar 

  • Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco

    Google Scholar 

  • Gupta JND (1988) Two stage hybrid flowshop scheduling problem. J Oper Res Soc 39:359–364

    Google Scholar 

  • Gupta JND, Tunç EA (1994) Scheduling a two-stage hybrid flow shop with separable setup and removal times. Eur J Oper Res 77:415–428

    Article  Google Scholar 

  • Gupta JND, Stafford EF (2006) Flowshop scheduling research after five decades. Eur J Oper Res 169:699–711

    Article  Google Scholar 

  • Heike G, Ramulu M, Sorenson E, Shanahan P, Moinzadeh K (2001) Mixed model assembly alternatives for low-volume manufacturing: the case of the aerospace industry. Int J Prod Econ 72(2):103–120

    Article  Google Scholar 

  • Hunsucker JL, Shah JR (1994) Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment. Eur J Oper Res 72:102–114

    Article  Google Scholar 

  • Linn R, Zhang W (1999) Hybrid flow shop scheduling: a survey. Comput Ind Eng 37:57–61

    Article  Google Scholar 

  • Lobo BJ (2011) Allocating manpower to minimize Lmax in a job shop. PhD thesis, North Carolina State University

  • Naderi B, Ruiz R, Zandieh M (2010) Algorithms for a realistic variant of flowshop scheduling. Comput Oper Res 37(2):236–246

    Google Scholar 

  • Nowicki E, Smutnicki CA (1998) The flow shop with parallel machines: a tabu search algorithm. Eur J Oper Res 106:226–253

    Article  Google Scholar 

  • Pentico DW (2007) Assignment problems: a golden anniversary survey. Eur J Oper Res 176:774–793

    Article  Google Scholar 

  • Potts CN, Strusevich V (2009) Fifty years of scheduling: a survey of milestones. J Oper Res Soc 60:41–68

    Article  Google Scholar 

  • Ruiz R, Vázquez-Rodríguez JA (2010) The hybrid flow shop scheduling problem. Eur J Oper Res 205:1–18

    Article  Google Scholar 

  • Savelsbergh MWP (1997) A branch-and-cut algorithm for the generalized assignment problem. Oper Res 45(6):831–884

    Article  Google Scholar 

  • Xu J, Xu X, Xie SQ (2011) Recent developments in Dual Resource Constrained (DRC) system research. Eur J Oper Res 215(2):309–318

    Article  Google Scholar 

  • Zäpfel G, Wasner M (2000) A heuristic solution concept for a generalized machine sequencing problem with an application to radiator manufacturing. Int J Prod Econ 68:199–213

    Article  Google Scholar 

  • Zäpfel G, Braune R, Bögl M (2010) Metaheuristic search concepts—a tutorial with applications to production and logistics. Springer, Heidelberg

    Google Scholar 

Download references

Acknowledgements

We are grateful to Mr. Ortner for his support in programming the algorithm and conducting the numerical experiments.

Author information

Authors and Affiliations

  1. Institut für Produktions- und Logistikmanagement, Johannes Kepler Universität, Altenbergerstrasse 69, 4040, Linz, Austria

    Günther Zäpfel,  Michael Wasner &  Roland Braune

Authors
  1. Günther Zäpfel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Wasner
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Roland Braune
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Günther Zäpfel.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zäpfel, G., Wasner, M. & Braune, R. Integration between flow scheduling and personnel allocation in a parallel line system in automotive industry. Z Betriebswirtsch 82, 417–432 (2012). https://doi.org/10.1007/s11573-012-0555-2

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11573-012-0555-2

Keywords

JEL Classification

Search

Navigation