发布求助
文献互助 智能选刊 最新文献

Int. J. Adv. Oper. Manag.最新文献

筛选
英文 中文
Comparison of different types of variability when using lot splitting in a dynamic open job shop 动态开放式作业车间中不同类型的可变性的比较
Int. J. Adv. Oper. Manag. Pub Date : 2013-08-14 DOI: 10.1504/IJAOM.2013.055866
Kurt Hozak
{"title":"Comparison of different types of variability when using lot splitting in a dynamic open job shop","authors":"Kurt Hozak","doi":"10.1504/IJAOM.2013.055866","DOIUrl":"https://doi.org/10.1504/IJAOM.2013.055866","url":null,"abstract":"Previousshop floor control research has shown that lot splitting can improve flow time performance and that disruptions to smooth and even material flow through the production process are detrimental. We use a simulation model to extend the literature by differentiating between four types of variability that might disrupt material flow and by analysing their effects on the magnitude of flow time improvement from lot splitting in dynamic open job shops with a range of utilisations, setup to processing time ratios, and job sizes. We believe that we are the first to show that those types of variability have vastly different effects on how much flow time improvement lot splitting can offer. The findings will help manufacturers identify processes that will benefit the most from lot splitting and aid researchers in developing better experimental designs.","PeriodicalId":191561,"journal":{"name":"Int. J. Adv. Oper. Manag.","volume":"315 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116284798","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Hybrid principal component analysis technique to machine-part grouping problem in cellular manufacturing system 元胞制造系统机件分组问题的混合主成分分析技术
Int. J. Adv. Oper. Manag. Pub Date : 2013-08-14 DOI: 10.1504/IJAOM.2013.055868
Tamal Ghosh, Manojit Chattopadhyay, P. Dan
{"title":"Hybrid principal component analysis technique to machine-part grouping problem in cellular manufacturing system","authors":"Tamal Ghosh, Manojit Chattopadhyay, P. Dan","doi":"10.1504/IJAOM.2013.055868","DOIUrl":"https://doi.org/10.1504/IJAOM.2013.055868","url":null,"abstract":"This article portrays a hybrid principal component analysis (PCA)-based technique to construct production cells in cellular manufacturing system (CMS). The key problem in CMS is to recognise the machine cells and corresponding part families and subsequently the formation of production cells. A novel approach is considered in this study to systematise a hybrid multivariate clustering technique based on covariance analysis to form the machine cells in CMS. The intended technique is demonstrated in three segments. Firstly, a similarity matrix is developed by exploiting the covariance analysis procedure. In the second stage, the PCA is utilised to identify the potential clusters in CMS with the assistance of eigenvalue and eigenvector computation. In the last stage, an adjustment heuristic is adopted to improve the solution quality and consequently the clustering efficiency. This article states that, the addition of the adjustment heuristic approach into a traditional multivariate PCA-based clustering technique not only enhances the solution quality significantly, but also downgrades the inconsistency of the solutions achieved. The hybrid technique is tested on 24 test datasets available in published articles and it is shown to outperform other published methodologies by enhancing the solution quality on the test problems.","PeriodicalId":191561,"journal":{"name":"Int. J. Adv. Oper. Manag.","volume":"357 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131807078","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A probabilistic kernel approach for solving the multi-instance learning problems with different assumptions 一种求解不同假设下多实例学习问题的概率核方法
Int. J. Adv. Oper. Manag. Pub Date : 2013-08-14 DOI: 10.1504/IJAOM.2013.055881
Lixin Shen, Jianjun He, Shuang Qiao
{"title":"A probabilistic kernel approach for solving the multi-instance learning problems with different assumptions","authors":"Lixin Shen, Jianjun He, Shuang Qiao","doi":"10.1504/IJAOM.2013.055881","DOIUrl":"https://doi.org/10.1504/IJAOM.2013.055881","url":null,"abstract":"Multi-instance learning (MIL) has received more and more attentions in the machine learning research field due to its theoretical interest and its applicability to diverse real-world problems. In this paper, we present a probabilistic kernel approach for the multi-instance learning problems with various multi-instance assumptions by imposing Gaussian process prior on an unobservable latent function defined on the instance space. Because the relationship between the bag and its instances, triggered by the multi-instance assumption, can be exactly captured by defining the likelihood function, we can deal with different multi-instance assumptions by employing different likelihood functions. Experimental results on several multi-instance problems show that the proposed algorithms are valid and can achieve superior performance to the published MIL algorithms.","PeriodicalId":191561,"journal":{"name":"Int. J. Adv. Oper. Manag.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114226473","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A scatter search algorithm for real-time scheduling with timing, precedence and exclusion constraints 一种具有时序、优先和排除约束的实时调度分散搜索算法
Int. J. Adv. Oper. Manag. Pub Date : 2013-04-30 DOI: 10.1504/IJAOM.2013.053531
Adel Bouridah, H. Drias, Yacine Laalaoui
{"title":"A scatter search algorithm for real-time scheduling with timing, precedence and exclusion constraints","authors":"Adel Bouridah, H. Drias, Yacine Laalaoui","doi":"10.1504/IJAOM.2013.053531","DOIUrl":"https://doi.org/10.1504/IJAOM.2013.053531","url":null,"abstract":"Tasks scheduling is one of the most important challenges in embedded hard-real-time systems. The problem is known to be NP-hard and exhaustive search algorithms have no significant benefit in large-scale context. This paper proposes a scatter search-based approach for mono-processor systems with timing, precedence and exclusion constraints with no pre-emption. An empirical study is undertaken and comparison is done with results of other algorithms.","PeriodicalId":191561,"journal":{"name":"Int. J. Adv. Oper. Manag.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133986890","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Timetabling hub-and-spoke parcel distribution inter-facility network 时间表轮辐式包裹配送设施间网络
Int. J. Adv. Oper. Manag. Pub Date : 2013-04-30 DOI: 10.1504/IJAOM.2013.053530
Omar Ben-Ayed
{"title":"Timetabling hub-and-spoke parcel distribution inter-facility network","authors":"Omar Ben-Ayed","doi":"10.1504/IJAOM.2013.053530","DOIUrl":"https://doi.org/10.1504/IJAOM.2013.053530","url":null,"abstract":"This paper introduces an important problem encountered when designing hub-and-spoke parcel distribution network. This problem, which comes after generating the network design and before implementing it, is concerned with parcel timetabling. A non-linear model, composed of the shipping-time objective function and the time-precedence constraints, is developed in order to optimise the daily movements of parcels from their origins to their destinations. The resolving of the problem highly depends on the ability of the analyst to develop intelligent ways to limit the values of decision variables. The model applied to a real-world case is entered in a spreadsheet where the objective function is evaluated for the possible decision variable values; the timetable generated for a newly designed hub-and-spoke network decreased shipping time by around 30% as compared to the timetable of the existing design.","PeriodicalId":191561,"journal":{"name":"Int. J. Adv. Oper. Manag.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130437934","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
A contribution for integrating dispatching and covering in the emergency vehicles management services 为在应急车辆管理服务中整合调度和覆盖作出贡献
Int. J. Adv. Oper. Manag. Pub Date : 2013-04-30 DOI: 10.1504/IJAOM.2013.053533
S. Ibri, M. Nourelfath, H. Drias
{"title":"A contribution for integrating dispatching and covering in the emergency vehicles management services","authors":"S. Ibri, M. Nourelfath, H. Drias","doi":"10.1504/IJAOM.2013.053533","DOIUrl":"https://doi.org/10.1504/IJAOM.2013.053533","url":null,"abstract":"In the vehicle management systems, two important issues have to be considered by managers: the dispatching problem with the aim of minimising the response time for current emergency calls; and the covering problem with the objective of keeping proper coverage to satisfy future calls in best times. The purpose of this paper is to investigate the value, in terms of service quality, of integrating the dispatching and covering problems in the same model. A heuristic algorithm, combining ant optimisation and tabu search is used as a solution approach and is included in a discrete event simulator that simulate the working of the system in real time. Several numerical examples are used to compare the integrated approach and the non-integrated one.","PeriodicalId":191561,"journal":{"name":"Int. J. Adv. Oper. Manag.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133256330","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
New multiobjective optimisation algorithms for assembly lines design 装配线设计的新多目标优化算法
Int. J. Adv. Oper. Manag. Pub Date : 2013-04-30 DOI: 10.1504/IJAOM.2013.053532
H. Chehade, F. Yalaoui, L. Amodeo
{"title":"New multiobjective optimisation algorithms for assembly lines design","authors":"H. Chehade, F. Yalaoui, L. Amodeo","doi":"10.1504/IJAOM.2013.053532","DOIUrl":"https://doi.org/10.1504/IJAOM.2013.053532","url":null,"abstract":"Multiobjective optimisation methods for an assembly line design problem are presented in this paper. The studied problem consists of two parts. Among a set of candidate machines, the first part of the problem aims to assign a single machine to each workstation. The goal of the second part is to size the intermediate buffers. Two objectives are taken in consideration for our design problem: the minimisation of the cost of the line and the maximisation of the throughput rate. Different new multiobjective methods are developed to solve the problem. First, a multiobjective ant colony optimisation algorithm is proposed. Then, in order to get better results, the first algorithm is coupled with a guided local search. The third method proposed for the first time to solve our problem, called L-ant, is based on a multiobjective ant colony algorithm but using the Lorenz dominance. The fourth algorithm is another new method based on genetic algorithms and the Lorenz dominance and called Lorenz-archive. In order to compare the different methods to each others and to assess their efficiency, different measuring criteria are applied on the best fronts with the non-dominated solutions.","PeriodicalId":191561,"journal":{"name":"Int. J. Adv. Oper. Manag.","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127969241","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A new heuristic approach for solving facility layout problem 一种求解设施布局问题的启发式新方法
Int. J. Adv. Oper. Manag. Pub Date : 2013-04-30 DOI: 10.1504/IJAOM.2013.053534
R. Matai, S. P. Singh, M. L. Mittal
{"title":"A new heuristic approach for solving facility layout problem","authors":"R. Matai, S. P. Singh, M. L. Mittal","doi":"10.1504/IJAOM.2013.053534","DOIUrl":"https://doi.org/10.1504/IJAOM.2013.053534","url":null,"abstract":"This paper proposes a new heuristic approach for solving facility layout problem (FLP) which is traditionally formulated as quadratic assignment problem (QAP). In this paper, FLP is formulated as linear assignment problem (LAP) consisting of facility pair and location pair. Being linear in nature LAP can be solved efficiently. Solution of LAP provides lower bound on corresponding QAP formulation of FLP. Heuristic procedure is applied to solve FLP from sets of LAP solution. Proposed heuristic is tested on benchmark instances taken from literature and compared with other heuristics available in literature. Computational results show that proposed heuristic provides a good quality approximate solution. This solution can be taken as initial solution for any improvement heuristic to get optimal/near optimal solution for FLP.","PeriodicalId":191561,"journal":{"name":"Int. J. Adv. Oper. Manag.","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114321441","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Complex data structures in product design: a sequential approach to elicit customer perceptions 产品设计中的复杂数据结构:引出客户感知的顺序方法
Int. J. Adv. Oper. Manag. Pub Date : 2013-01-07 DOI: 10.1504/IJAOM.2013.051325
M. Camargo, C. Fonteix, F. Delmotte
{"title":"Complex data structures in product design: a sequential approach to elicit customer perceptions","authors":"M. Camargo, C. Fonteix, F. Delmotte","doi":"10.1504/IJAOM.2013.051325","DOIUrl":"https://doi.org/10.1504/IJAOM.2013.051325","url":null,"abstract":"The present paper proposes a new methodology to integrate expert judgement in new product development decision process. In particular, within the garment industry product evaluation data come mainly from judges or consumer panels. Treatment of aggregate data is difficult as some measures could seem to be contradictory. To deal with this issue the present paper proposes the application of a sequential fitting (SEFIT) approach to exploit information from the whole set of data. SEFIT methods, proposed originally by (Mirkin, 1990) attempt to explain the variability in the initial data (commonly defined by a sum of squares) through an additive decomposition terms in the model. In this case, data from expert’s evaluation of a set of garment products, concerning six predetermined fashion themes (judge perception), are treated to determine the importance level of each criterion.","PeriodicalId":191561,"journal":{"name":"Int. J. Adv. Oper. Manag.","volume":"181 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116855749","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
From body measurements to body shape perception: an intelligent tool for garment design 从身材测量到体型感知:服装设计的智能工具
Int. J. Adv. Oper. Manag. Pub Date : 2013-01-07 DOI: 10.1504/IJAOM.2013.051327
Lichuan Wang, Xianyi Zeng, L. Koehl, Yan Chen
{"title":"From body measurements to body shape perception: an intelligent tool for garment design","authors":"Lichuan Wang, Xianyi Zeng, L. Koehl, Yan Chen","doi":"10.1504/IJAOM.2013.051327","DOIUrl":"https://doi.org/10.1504/IJAOM.2013.051327","url":null,"abstract":"This paper presents a model characterising the relation between emotional descriptive keywords describing human body shapes and concrete body measurements. Three procedures have been proposed for building this model. In the first procedure, the experts generate a list of emotional descriptors describing human body shapes and then evaluate a set of virtual human bodies of different shapes using these descriptors. Next, two algorithms of decision tree (CART and fuzzy-ID3) have been applied for modelling the relation between each emotional descriptor and the ratios of relevant body measurements. In the second procedure, the experts evaluate the relationship between these concrete emotional descriptors and a number of abstract fashion themes such as ‘sporty’ and ‘attractive’ without taking into account any specific human body shape. This conceptual relationship given by different experts is modelled using a fuzzy cognitive map. In the third procedure, the two previous models are combined using the fuzzy relation operations. Using this combined model, garment designers can quickly identify personalised and variable body shapes, expressed by a set of concrete and abstract keywords, from human body measurements. These keywords will be further integrated into an expert knowledge base of garment design for developing personalised new products.","PeriodicalId":191561,"journal":{"name":"Int. J. Adv. Oper. Manag.","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124799817","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信