Scheduling the part supply of mixed-model assembly lines in line-integrated supermarkets

European Journal of Operational Research

Volumn 239, Issue 3, 2014, Pages 820-829

  Boysen, Nils ^a   Emde, Simon ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

Automobile industry; In house logistics; Mixed model assembly lines; Part supply

Indexed keywords

ASSEMBLY; ASSEMBLY MACHINES; AUTOMOTIVE INDUSTRY; BINS; RETAIL STORES;

ASSEMBLY WORKERS; COMPLEXITY ANALYSIS; HEURISTIC DECOMPOSITION; LOGISTICS CONCEPTS; MANAGERIAL ASPECTS; MIXED-MODEL ASSEMBLY LINES; PART SUPPLIES; SCHEDULING PROBLEM;

SCHEDULING;

EID: 84906223719     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2014.05.029     Document Type: Article

References (23)

1. A. Agnetis, A. Alfieri, and G. Nicosia Single-machine scheduling problems with generalized preemption Informs Journal on Computing 21 2009 1 12
2. A. Allahverdi, J.N.D. Gupta, and T. Aldowaisan A review of scheduling research involving setup considerations Omega 27 1999 219 239
3. D. Battini, N. Boysen, and S. Emde Just-in-Time supermarkets for part supply in the automobile industry Journal of Management Control 24 2013 209 217
4. J. Bautista, R. Companys, and A. Corominas Heuristics and exact algorithms for solving the Monden problem European Journal of Operational Research 88 1996 101 113
5. N. Boysen, S. Bock, and M. Fliedner Scheduling of inventory releasing jobs to satisfy time-varying demand: An analysis of complexity Journal of Scheduling 16 2013 185 198
6. N. Boysen, M. Fliedner, and A. Scholl Sequencing mixed-model assembly lines: Survey, classification and model critique European Journal of Operational Research 192 2009 349 373
7. Y.A. Bozer, and L.F. McGinnis Kitting versus line stocking: A conceptual framework and a descriptive model International Journal of Production Economics 28 1992 1 19
8. Brynzér, and Johansson Design and performance of kitting and order picking systems International Journal of Production Economics 41 1995 115 125
9. A. Drexl, and A. Kimms Lot sizing and scheduling - Survey and extensions European Journal of Operational Research 99 1997 221 235
10. G. Dueck, and T. Scheuer Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing Journal of Computational Physics 90 1990 161 175
11. P.F. Dutot, G. Mounié, and D. Trystram Scheduling parallel tasks - Approximation algorithms J.T. Leung, Handbook of scheduling: Algorithms, models, and performance analysis 2004 CRC Press Chapman Hall
12. S. Emde, and N. Boysen Optimally routing and scheduling tow trains for JIT-supply of mixed-model assembly lines European Journal of Operational Research 217 2012 287 299
13. S. Emde, M. Fliedner, and N. Boysen Optimally loading tow trains for JIT-supply of mixed-model assembly lines IIE Transactions 44 2012 121 135
14. M.R. Garey, and D.S. Johnson Computers and intractability: A guide to the theory of NP-completeness 1979 Freeman New York
15. S.Y. Hua, and D.J. Johnson Research issues on factors influencing the choice of kitting versus line stocking International Journal of Production Research 48 2010 779 800
16. B. Karimi, S.M.T. Fatemi Ghomi, and J.M. Wilson The capacitated lot sizing problem: A review of models and algorithms Omega 31 2003 365 378
17. W. Kubiak Minimizing variation of production rates in just-in-time systems: A survey European Journal of Operational Research 66 1993 259 271
18. V. Limére, H. Van Landeghem, M. Goetschalckx, E.-H. Aghezzaf, and L.F. McGinnis Optimising part feeding in the automotive assembly industry: Deciding between kitting and line stocking International Journal of Production Research 50 2012 4046 4060
19. Z. Liu, and T.C.E. Cheng Scheduling with job release dates, delivery times and preemption penalties Information Processing Letters 82 2002 107 111
20. Z. Liu, and T.C.E. Cheng Minimizing total completion time subject to job release dates and preemption penalties Journal of Scheduling 7 2004 313 327
21. H. Meyr Simultaneous lotsizing and scheduling on parallel machines European Journal of Operational Research 139 2002 277 292
22. Mucha, M., & Sankowski, P. (2004). Maximum matchings via Gaussian elimination. In Proc. 45th IEEE symp. foundations of computer science (pp. 248-255).
23. D. Quadt, and H. Kuhn Capacitated lot-sizing with extensions: A review 4OR 6 2008 61 83