Optymalizacja procesu wysyłki cukru

• Authors: R. Pytlak , W. Stecz

Title variants

EN

Optimization of sugar dispatching proces

Abstracts

EN

We consider the sugar dispatching process at a sugar mill. The main goal of our work was to check an efficiency of the logistics system in the mill, find and correct the bottlenecks. Some methods for logistics processes optimization are presented. We base on the heuristics and CLP techniques for solving the scheduling problems. Some additional remarks about possibility of using the optimization methods in scheduling and logistics optimizations are presented too.

Keywords

PL

systemy gniazdowe; optymalizacja procesów logistycznych; CLP w harmonogramowaniu; programowanie z ograniczeniami

EN

job shop scheduling; optimization in logistics; CLP in scheduling; constraint programming

• Publisher: Polskie Wydawnictwo Ekonomiczne
• Journal: Gospodarka Materiałowa i Logistyka
• Year: 2014
• Issue: 2
• Pages: 21-30

Dates

published

2014

Contributors

author

R. Pytlak

• Politechnika Warszawska, Instytut Automatyki i Robotyki

author

W. Stecz

• Wojskowa Akademia Techniczna, Wydział Cybernetyki

References

• Brucker, P. (2007). Scheduling algorithms. Berlin: Springer.
• Brucker, P., Knust, S. (2006). Complez scheduling. Berlin: Springer.
• CISCO Systems (2006). ECLiPSe User Manual ver. 6.0.
• CISCO Systems (2006). ECLiPSe Tutorial Introduction ver. 6.0.
• Fruwirth, T., Abdennadher, S. (2003). Essentials of constraint programming. Berlin: Springer.
• Grabowski, J., Nowicki, E., Smutnicki, Cz. (2003). Metoda blokowa w zagadnieniach szeregowania zadań. Warszawa: Akademicka Oficyna Wydawnicza EXIT.
• IBM ILOG. (2009). ILOG OPL Language User’s manual ver. 6.3 IBM ILOG. (2009). User's manual for CPLEX ver. 12.2
• Liverani, A. (2002). Using Genetic Algorithms to Optimise Kanban-Based Production System. Germany: The European Applied Business Research Conference.
• Gospodarka Materiałowa i Logistyka nr 2/2014
• Monch, L., Driefel, R. (2005). A distributed shifting bottleneck heuristic for complex job shops (363-380). Computers and Industrial Engineering.
• Nemhauser, G.L., Wolsey L.A. (1988). Integer and Combinatorial Optimization. New York: John Wiley & Sons.
• Neumann, K., Schwindt, Ch., Zimmermann, J. (2003). Project scheduling with time Windows and scarce resources. Berlin: Springer.
• Nocedal, J., Wright, S. J. (1999). Numerical optimization. New York: Springer-Verlag.
• Pinedo, M. (2001). Scheduling: Theory, Algorithms and Systems. Prentice Hall.
• Preactor Int. (2005). Introduction to Scheduling. Preactor International.
• Pytlak. R., Stecz, W. (2010). Optimizing routes for logistics operators. Poznań: Zeszyty Naukowe Politechniki Poznańskiej.
• Stecz, W. i inni. (2009). Sugar plan transportation problem reconstruction using optimization software. W: M. Fertsch, K. Grzybowska, A. Stachowiak (eds.), Modelling of modem enterprises logistics (25-37). Poznań: Publishing House of Poznan University of Technology.
• Wallace, M. (2005). Hybrid algorithms, local search and ECLiPSe. CP Summer School.
• Wallace, M., Schimpf J. (2002). Finding the right hybrid algorithm - A combinatorial meta-problem. Annals of Mathematics and Artificial Intelligence, 34, 259-269.
• Wolsey, L.A., Neumhauser N.L. (1999). Integer and combinatorial optimization. Wiley-Interscience.

Identifiers

Biblioteka Nauki

1378130