BazEkon - Biblioteka Główna Uniwersytetu Ekonomicznego w Krakowie

BazEkon home page

Meny główne

Smutnicki Czesław (Wrocław University of Technology)
Scheduling with High Variety of Customized Compound Products
Decision Making in Manufacturing and Services, 2007, vol. 1, nr 1/2, s. 91-110, rys., tab., bibliogr. 21 poz.
Słowa kluczowe
Rynek sprzętu AGD, Proces produkcji, Rozwiązywanie problemów, Modele Markowa
Home appliances market, Production process, Solving problems, Markov models
Domestic appliance is an instance of manufacturing various products on clients demand with frequent changes of production. Although the technological process for each individual product is relatively simply, the variety of products, mixed orders, frequent machines changeovers, machines with unusual service policy, lack or limited storage, etc., generates quite nontrivial planning, batching and scheduling problems and furthermore of a huge size. In this paper, we present speci c real process of production of refrigerators, mathematical and graph models of the problem and an outline of solution algorithm, based the on local search approach. (original abstract)
Pełny tekst
  1. E.H.L. Aarts, P.J.M. van Larhoven, Simulated annealing: a pedestrain review of the theory and some applications, In: Patter Recognition and Applications, Eds. P.A. Devijver, J. Kittler, Springer, Berlin, 1987.
  2. P. Brucker, A. Drexl, R. Möhring, K. Neumann, E. Pesch, Resource-constrained project scheduling: Notation, classification, models, and methods, European Journal of Operational Research 112 (1999), 3-41.
  3. P. Brucker, S. Knust, A. Schoo, O. Thiele, A branch and bound algorithm for the resource-constrained project scheduling problem, European Journal of Operational Research 107 (1998), 272-288.
  4. P. Budyn, Scheduling under frequent changes of production profile, MSc Thesis, ICECR, Wroclaw University of Technology, 2007.
  5. F. Glover, M. Laguna Tabu search, Kluwer Academic Publishers, 1996.
  6. W. Herroelen, E. Demeulemeester, B. De Reyck, Resource-constrained project scheduling, A survey of recent developments, Computers & Operations Research 25 (1998), 4, 279-302.
  7. R. Kolisch, A. Drexl, Local search for nonpreemptive multi-mode resource-constrained project scheduling, IIE Transactions 29 (1997), 987-999.
  8. R. Kolisch, S. Hartmann, Heuristic Algorithms for Solving the Resource Constrained Project Scheduling Problem: Classification and Computational Analysis, in: J. W¸eglarz (ed.), Handbook on Recent Advances in Project Scheduling, 147-178. Kluwer, 1999.
  9. R. Kolisch, R. Padman, An integrated survey of deterministic project scheduling, Omega, 29 (2001), 249-272.
  10. M. Laguna, R. Marti (2003) Scatter search. Methodology and implementation in C, Kluwer Academic Publishers, 2006.
  11. M. Mori, C.C. Tseng, A genetic algorithm for multi-mode resource constrained project scheduling, European Journal of Operational Research 100 (1997), 134-141.
  12. K. Neumann, C. Schwindt, N. Trautmann, Advanced production scheduling for batch plants in process industries, in: Günther H.O., Beek P, (eds.) Advanced Planning and Scheduling Solutions in Process Industry, Springer 2003.
  13. E. Nowicki, C. Smutnicki, A decision support system for resource constrained project scheduling problem, European Journal of Operational Research 79 (1994), 183-195.
  14. E. Nowicki, C. Smutnicki, A fast taboo search algorithm for the job shop problem, Management Science 6 (1996), 797-813.
  15. E. Nowicki, C. Smutnicki, Flow shop with parallel machines. A tabu search approach, European Journal of Operational Research 106 (1998), 226-253.
  16. E. Nowicki, C. Smutnicki a Some new ideas in TS for job-shop scheduling, in: Rego C. and Alidaee B. (eds.) Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search, Kluwer Academic Publishers, 2005.
  17. E. Nowicki, C. Smutnicki b, New algorithm for the job-shop problem, Journal of Scheduling 8 (2005), 145-159.
  18. L. Özdamar, G. Ulusoy, An iterative local constrained based analysis for solving the resource constrained project scheduling problem. Journal of Operations Management 14 (1996), 3, 193-208.
  19. F. Salewski, A. Schirmer, A. Drexl, Project scheduling under resource and mode identity constraints: Model, complexity, methods, and application, European Journal of Operational Research 102 (1997), 88-110.
  20. A. Sprecher, A. Drexl, Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm, European Journal of Operational Research 107 (1998), 431-450.
  21. P.R. Thomas, S. Salhi, A Tabu Search Approach for the Resource Constrained Project Scheduling Problem, Journal of Heuristics 4 (1998), 123-139.
Cytowane przez
Udostępnij na Facebooku Udostępnij na Twitterze Udostępnij na Google+ Udostępnij na Pinterest Udostępnij na LinkedIn Wyślij znajomemu