PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
2022 | 16 | 47--65
Tytuł artykułu

Heuristic Algorithm for lot Sizing and Scheduling on Identical Parallel Machines

Autorzy
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
In this paper a newly developed heuristic algorithm for lotsizing and scheduling on identical parallel machines is presented. A basic concept and an aim of lotsizing and scheduling are described and clarified. Furthermore, models for considered problems for fixed and variable demand as well as for one and many identical parallel machines are presented. A concept and a formal description of newly developed heuristic algorithm is described. The paper includes in details the obtained results and solutions of conducted experiments and the description of used data sets.(original abstract)
Rocznik
Tom
16
Strony
47--65
Opis fizyczny
Twórcy
  • AGH University of Science and Technology Kraków, Poland
Bibliografia
  • Beraldi P., Ghiani G., Grieco A. & Guerriero E. (2008). Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs. Computers and Operations Research, 35(11), pp. 3644-3656. doi: 10.1016/j.cor.2007.04.003.
  • GUROBI (2022). http://www.gurobi.com/products/gurobi-optimizer [11.12.2022].
  • Haase K. (1994). Lotsizing and Scheduling for Production Planning. Lecture Notes in Economics and Mathematical Systems, vol. 408, Springer-Verlag.
  • Jans R.F. & Degraeve Z. (2008). Modeling industrial lot sizing problems: A review. International Journal of Production Research, 46(6), pp. 1619-1643. doi: 10.1080/00207540600902262.
  • Kaczmarczyk W. (2006). Modele PLC planowania wielkości i szeregowania partii z identycznymi liniami równoległymi. Zeszyty Naukowe. Automatyka / Politechnika Śląska, 144, pp. 23-32.
  • Kaczmarczyk W. (2011). Proportional lot-sizing and scheduling problem with identical parallel machines. International Journal of Production Research, 49(9), pp. 2605-2623. doi: 10.1080/00207543.2010.532929.
  • Kimms A. & Drexl A. (1998). Some insights into proportional lot sizing and scheduling. Journal of the Operational Research Society, 49(11), pp. 1196-1205. doi: 10.2307/3010100.
  • Lasdon L. & Terjung R. (1971). An efficient algorithm for multi-item scheduling. Operations Research, 19, pp. 946-969. doi: 10.1287/opre.19.4.946.
  • Mehdizadeh E., Tavakkoli-Moghaddam R. & Yazdani M. (2015). A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times. Applied Mathematical Modelling, 39(22), pp. 6845-6859. doi: 10.1016/j.apm.2015.02.027.
  • Mensendiek A., Gupta J.N.D. & Herrmann J. (2015). Scheduling identical paralel machines with fixed delivery dates to minimize total tardiness. European Journal of Operational Research, 243(2), pp. 514-522. doi: 10.1016/j.ejor.2014.12.002.
  • Miodońska B. (2006). Koordynacja w łańcuchach dostaw [MSc Thesis]. AGH University of Science and Technology, Krakow.
  • Pochet Y. & Wolsey L. (2006). Production Planning by Mixed Integer Programming. Springer Series in Operations Research and Financial Engineering, Springer, New York. doi: 10.1007/0-387-33477-7.
  • PyPy (2022). https://pypy.org/ [12.11.2022].
Typ dokumentu
Bibliografia
Identyfikatory
Identyfikator YADDA
bwmeta1.element.ekon-element-000171689484

Zgłoszenie zostało wysłane

Zgłoszenie zostało wysłane

Musisz być zalogowany aby pisać komentarze.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.