Tek Makineli Çizelgelemede Takım Değişikliği Durumunda Maksimum Gecikme Minimizasyonu: Tamsayılı Programlama Modeli
Öz
Tek makineli çizelgeleme problemlerinde temel varsayımlardan biri makinelerin devamlı çalıştığıdır. Halbuki pratikte bakım, bozulma ve takım değiştirme gibi faaliyetlerden dolayı makinelerin kullanılmadığı zamanlar olabilmektedir. Bu çalışmada takım değiştirmeli tek makineli çizelgeleme problemi ele alınacaktır. Ele alınan problemin amaç fonksiyonu maksimum gecikmeyi minimize etmektir. NP-zor yapıda olan problemi çözmek için tamsayılı programlama modeli geliştirilmiştir. Geliştirilen model örnek üzerinde uygulanmıştır.
Anahtar Kelimeler
Tek makineli çizelgeleme takım değişikliği maksimum gecikme tamsayılı programlama
Kaynakça
- [1] C.J. Liao, W.J. Chen, “Single-machine scheduling with periodic maintenance and nonresumable jobs”, Computers & Operations Research, 30, 1335–1347, 2003. [2] W.J. Chen, “An efficient algorithm for scheduling jobs on a machine with periodic maintenance”, The International Journal of Advanced Manufacturing Technology, 34, 1173–1182. 2007 [3] W.J. Chen, “Minimizing number of tardy jobs on a single machine subject to periodic maintenance”, Omega 37 (3), 591–599, 2009. [4] T. Eren, “Periyodik bakımlı çizelgeleme problemi”, Yıldız Teknik Üniversitesi, 2. Ulusal Sistem Mühendisliği Kongresi, İstanbul, 361-364, 6-8 Şubat 2008. [5] E. Gray, A. Seidmann, K.E. Stecke, A synthesis of decision models for tool management in automated manufacturing, Management Science, 39, 549 –567, 1993. [6] D. Veeramani, D.M. Upton, M.M. Barash, “ Cutting tool management in computer integrated manufacturing”, International Journal of Flexible Manufacturing Systems, 4, 237–265, 1992. [7] P. Tomek, “Tooling strategies related to FMS management”, FMS Mag, 5, 102–107, 1986. [8] P. Kouvelis, “An optimal tool selection procedure for the initial design phase of a flexible manufacturing system”, European Journal of Operational Research, 55, 201–210, 1991. [9] M.S. Akturk, J.B. Ghosh, E.D. Gunes, “Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance”, Naval Research Logistics, 50, 15– 30, 2003. [10] S.W. Flanders, W.J. Davis, “Scheduling a flexible manufacturing system with tooling constraints: An actual case study”, Interfaces, 25, 42–54, 1995. [11] Y. Crama, “Combinatorial optimization models for production scheduling in automated manufacturing systems”, Eur J Oper Res 99, 136 –153, 1997. [12] M.S. Akturk, J.B. Ghosh, E. D. Gunes, “Scheduling with tool changes to minimize total completion time: Basic results and SPT performance”, European Journal of Operational Research, 157, 784-790, 2004. [13] M.S. Akturk, J.B. Ghosh, R.K. Kayan, “Scheduling with tool changes to minimize total completion time under controllable machining conditions”, Computers & Operations Research, 34, 2130–2146, 2007. [14] J.S. Chen, J.S. Yang, “Alternative Models for Solving Single-Machine Scheduling with Tool Changes”, Information and Management Sciences, 18 (3), 283-297, 2007. [15] J.S. Chen, “Optimization models for the tool change scheduling problem”, Omega 36, 888 – 894, 2008. [16] D. Xu, M. Liu, Y. Yin, J. Hao, “Scheduling tool changes and special jobs on a single machine to minimize makespan”, Omega, in press, 2012.
Single Machine Scheduling with Tool Changes to Minimize Maximum Lateness: An Integer Programmıng Model
Öz
In the classical problem of scheduling jobs on a single machine, the assumption is always made that the machine is continuously available. In practice however, we of-ten encounter settings in which the machine may be unavailable for some period of time for different reasons, e.g., for preventive maintenance, breakdowns, or tool changes. In this study, we introduce a tool change into a single-machine scheduling problem. We consider the following objective function minimize to maximum lateness. An integer programming model are developed for problems which belongs to NP-hard class. Also the model is tested on an example.
Anahtar Kelimeler
Single machine scheduling tool change maximum lateness integer programming
Kaynakça
- [1] C.J. Liao, W.J. Chen, “Single-machine scheduling with periodic maintenance and nonresumable jobs”, Computers & Operations Research, 30, 1335–1347, 2003. [2] W.J. Chen, “An efficient algorithm for scheduling jobs on a machine with periodic maintenance”, The International Journal of Advanced Manufacturing Technology, 34, 1173–1182. 2007 [3] W.J. Chen, “Minimizing number of tardy jobs on a single machine subject to periodic maintenance”, Omega 37 (3), 591–599, 2009. [4] T. Eren, “Periyodik bakımlı çizelgeleme problemi”, Yıldız Teknik Üniversitesi, 2. Ulusal Sistem Mühendisliği Kongresi, İstanbul, 361-364, 6-8 Şubat 2008. [5] E. Gray, A. Seidmann, K.E. Stecke, A synthesis of decision models for tool management in automated manufacturing, Management Science, 39, 549 –567, 1993. [6] D. Veeramani, D.M. Upton, M.M. Barash, “ Cutting tool management in computer integrated manufacturing”, International Journal of Flexible Manufacturing Systems, 4, 237–265, 1992. [7] P. Tomek, “Tooling strategies related to FMS management”, FMS Mag, 5, 102–107, 1986. [8] P. Kouvelis, “An optimal tool selection procedure for the initial design phase of a flexible manufacturing system”, European Journal of Operational Research, 55, 201–210, 1991. [9] M.S. Akturk, J.B. Ghosh, E.D. Gunes, “Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance”, Naval Research Logistics, 50, 15– 30, 2003. [10] S.W. Flanders, W.J. Davis, “Scheduling a flexible manufacturing system with tooling constraints: An actual case study”, Interfaces, 25, 42–54, 1995. [11] Y. Crama, “Combinatorial optimization models for production scheduling in automated manufacturing systems”, Eur J Oper Res 99, 136 –153, 1997. [12] M.S. Akturk, J.B. Ghosh, E. D. Gunes, “Scheduling with tool changes to minimize total completion time: Basic results and SPT performance”, European Journal of Operational Research, 157, 784-790, 2004. [13] M.S. Akturk, J.B. Ghosh, R.K. Kayan, “Scheduling with tool changes to minimize total completion time under controllable machining conditions”, Computers & Operations Research, 34, 2130–2146, 2007. [14] J.S. Chen, J.S. Yang, “Alternative Models for Solving Single-Machine Scheduling with Tool Changes”, Information and Management Sciences, 18 (3), 283-297, 2007. [15] J.S. Chen, “Optimization models for the tool change scheduling problem”, Omega 36, 888 – 894, 2008. [16] D. Xu, M. Liu, Y. Yin, J. Hao, “Scheduling tool changes and special jobs on a single machine to minimize makespan”, Omega, in press, 2012.
Ayrıntılar
| Bölüm | Makaleler |
|---|---|
| Yazarlar | |
| Yayımlanma Tarihi | 15 Ocak 2013 |
| Gönderilme Tarihi | 23 Ekim 2017 |
| Yayımlandığı Sayı | Yıl 2013 Cilt: 5 Sayı: 1 |