A two-stage logarithmic goal programming method for generating weights from interval comparison matrices

2005 ◽  
Vol 152 (3) ◽  
pp. 475-498 ◽  
Author(s):  
Ying-Ming Wang ◽  
Jian-Bo Yang ◽  
Dong-Ling Xu
2018 ◽  
Vol 28 (3) ◽  
pp. 1107-1124 ◽  
Author(s):  
Tooraj Khosrojerdi ◽  
Seyed Hamed Moosavirad ◽  
Shahram Ariafar ◽  
Mahnaz Ghaeini-Hessaroeyeh

2021 ◽  
Vol 22 (2) ◽  
pp. 85
Author(s):  
Fitriani Utina ◽  
Lailany Yahya ◽  
Nurwan Nurwan

Nurse scheduling is one of the problems that often arise in hospital management systems. Head of ICU room and nurse to cooperate in making good nurse scheduling for the creation of optimal service. In this paper, we study a hospital nurse schedule design by considering the level of nurse education and the provision of holidays. Nurses with undergraduate education (S1) Nurses become leaders on every shift and are accompanied by nurses with diploma education (D3). The scheduling model in this study using the nonpreemptive goal programming method and LINGO 11.0 software. The preparation of the schedule of nurses assigned to this method can optimize the need for efficient nurses per shift based on education level. The data in the research was obtained by collecting administrative data at Aloei Saboe Gorontalo hospital. The data used are the published schedule by the head of the ICU room. In making a nurse schedule, there are limitations to consider such ashospital regulation. The results of the study obtained an optimal solution in the form of meeting all the desired obstacles. Computational results shows that nurse scheduling using the nonpreemptive goal programming method and LINGO 11.0 software better than the schedule created manually. Every shift is a maximum of one leader with an undergraduate education (S1) background and accompanied by a nurse with a diploma education (D3) background. Keywords: scheduling, goal programming, nonpreemptive goal programming.


2014 ◽  
Vol 641-642 ◽  
pp. 1271-1274 ◽  
Author(s):  
Mei Li ◽  
Jian Zhang ◽  
Xiao Peng Zhou

The paper take the distribution radius and carry capacity as constraint conditions, the author uses two-stage K-means algorithm to cluster community service shops, and determines the distribution region of distribution centers, and constructs a suitable model for distribution center’s locating. Basing on the clustering result, the incompatible two kinds items, i.e. fresh items and the items shopped online, are united in a model to be solved. Since bottom-up approach is used to build distribution network step by step, a multi-objective programming is converted into two relatively independent single goal programming, so the network’s optimization result is of good controllability, and the algorithm’s complexity is greatly reduced. Finally, take 100 communities fresh items as examples to implement algorithm.


Sign in / Sign up

Export Citation Format

Share Document