27 research outputs found
Classification of the Existing Knowledge Base of OR/MS Research and Practice (1990-2019) using a Proposed Classification Scheme
This is the author accepted manuscript. The final version is available from Elsevier via the DOI in this recordOperations Research/Management Science (OR/MS) has traditionally been defined as the discipline that applies advanced analytical methods to help make better and more informed decisions. The purpose of this paper is to present an analysis of the existing knowledge base of OR/MS research and practice using a proposed keywords-based approach. A conceptual structure is necessary in order to place in context the findings of our keyword analysis. Towards this we first present a classification scheme that relies on keywords that appeared in articles published in important OR/MS journals from 1990-2019 (over 82,000 articles). Our classification scheme applies a methodological approach towards keyword selection and its systematic classification, wherein approximately 1300 most frequently used keywords (in terms of cumulative percentage, these keywords and their derivations account for more than 45% of the approx. 290,000 keyword occurrences used by the authors to represent the content of their articles) were selected and organised in a classification scheme with seven top-level categories and multiple levels of sub-categories. The scheme identified the most commonly used keywords relating to OR/MS problems, modeling techniques and applications. Next, we use this proposed scheme to present an analysis of the last 30 years, in three distinct time periods, to show the changes in OR/MS literature. The contribution of the paper is thus twofold, (a) the development of a proposed discipline-based classification of keywords (like the ACM Computer Classification System and the AMS Mathematics Subject Classification), and (b) an analysis of OR/MS research and practice using the proposed classification
Deterministic Assembly Scheduling Problems: A Review and Classification of Concurrent-Type Scheduling Models and Solution Procedures
Many activities in industry and services require the scheduling of tasks that can be concurrently executed, the most clear example being perhaps the assembly of products carried out in manufacturing. Although numerous scientific contributions have been produced on this area over the last decades, the wide extension of the problems covered and the lack of a unified approach have lead to a situation where the state of the art in the field is unclear, which in turn hinders new research and makes translating the scientific knowledge into practice difficult.
In this paper we propose a unified notation for assembly scheduling models that encompass all concurrent-type scheduling problems. Using this notation, the existing contributions are reviewed and classified into a single framework, so a comprehensive, unified picture of the field is obtained. In addition, a number of conclusions regarding the state of the art in the topic are presented, as well as some opportunities for future research.Ministerio de Ciencia e Innovación español DPI2016-80750-
A new hybrid meta-heuristic algorithm for solving single machine scheduling problems
A dissertation submitted in partial ful lment of the
degree of Master of Science in Engineering (Electrical) (50/50)
in the
Faculty of Engineering and the Built Environment
Department of Electrical and Information Engineering
May 2017Numerous applications in a wide variety of elds has resulted in a rich history of research
into optimisation for scheduling. Although it is a fundamental form of the problem, the
single machine scheduling problem with two or more objectives is known to be NP-hard.
For this reason we consider the single machine problem a good test bed for solution
algorithms. While there is a plethora of research into various aspects of scheduling
problems, little has been done in evaluating the performance of the Simulated Annealing
algorithm for the fundamental problem, or using it in combination with other techniques.
Speci cally, this has not been done for minimising total weighted earliness and tardiness,
which is the optimisation objective of this work.
If we consider a mere ten jobs for scheduling, this results in over 3.6 million possible
solution schedules. It is thus of de nite practical necessity to reduce the search space in
order to nd an optimal or acceptable suboptimal solution in a shorter time, especially
when scaling up the problem size. This is of particular importance in the application
area of packet scheduling in wireless communications networks where the tolerance for
computational delays is very low. The main contribution of this work is to investigate
the hypothesis that inserting a step of pre-sampling by Markov Chain Monte Carlo
methods before running the Simulated Annealing algorithm on the pruned search space
can result in overall reduced running times.
The search space is divided into a number of sections and Metropolis-Hastings Markov
Chain Monte Carlo is performed over the sections in order to reduce the search space for
Simulated Annealing by a factor of 20 to 100. Trade-o s are found between the run time
and number of sections of the pre-sampling algorithm, and the run time of Simulated
Annealing for minimising the percentage deviation of the nal result from the optimal
solution cost. Algorithm performance is determined both by computational complexity
and the quality of the solution (i.e. the percentage deviation from the optimal). We
nd that the running time can be reduced by a factor of 4.5 to ensure a 2% deviation
from the optimal, as compared to the basic Simulated Annealing algorithm on the full
search space. More importantly, we are able to reduce the complexity of nding the
optimal from O(n:n!) for a complete search to O(nNS) for Simulated Annealing to
O(n(NMr +NS)+m) for the input variables n jobs, NS SA iterations, NM Metropolis-
Hastings iterations, r inner samples and m sections.MT 201
Application of Optimization in Production, Logistics, Inventory, Supply Chain Management and Block Chain
The evolution of industrial development since the 18th century is now experiencing the fourth industrial revolution. The effect of the development has propagated into almost every sector of the industry. From inventory to the circular economy, the effectiveness of technology has been fruitful for industry. The recent trends in research, with new ideas and methodologies, are included in this book. Several new ideas and business strategies are developed in the area of the supply chain management, logistics, optimization, and forecasting for the improvement of the economy of the society and the environment. The proposed technologies and ideas are either novel or help modify several other new ideas. Different real life problems with different dimensions are discussed in the book so that readers may connect with the recent issues in society and industry. The collection of the articles provides a glimpse into the new research trends in technology, business, and the environment
A Framework for Evaluating the Performance of Supply Chain Risk in E-commerce
The perceived risk is found to be a barrier for e-commerce application. It has been widely demonstrated in previous studies that the e-commerce is closely related with risk assessment. Taking into account of the scope of supply chain management, the activities of e-commerce system mostly deal with information flow, rather than either product or service flows. With regard to the rapid growth of e-commerce, there is imbalance between preparation and mitigation activities. More specifically, there is no formal model which shows supply chain risk in the e-commerce system, regarded as the research gap. Hence, one way to analyze and map out complex system as potential risk is to make Supply Chain Risk Management (SCRM) framework. This study is conducted to develop a framework about SCRM in the e-commerce area. Taking a case study on e-commerce based company, the SCRM framework is developed incorporating 8 perceived risk model in e-commerce: such as financial, social, time, performance, physical, privacy, security, and psychological risk. The expected contribution in theory and practice is discussed
New Solution Approaches for Scheduling Problems in Production and Logistics
The current cumulative PhD thesis consists of six papers published in/submitted to scientific journals. The focus of the thesis is to develop new solution approaches for scheduling problems encountering in manufacturing as well as in logistics. The thesis is divided into two parts: “ma-chine scheduling in production” and “scheduling problems in logistics” each of them consisting three papers.
To have most comprehensive overview of the topic of machine scheduling, the first part of the thesis starts with two systematic review papers, which were conducted on tertiary level (i.e., re-viewing literature reviews). Both of these papers analyze a sample of around 130 literature re-views on machine scheduling problems. The first paper use a subjective quantitative approach to evaluate the sample, while the second papers uses content analysis which is an objective quanti-tative approach to extract meaningful information from massive data. Based on the analysis, main attributes of scheduling problems in production are identified and are classified into sever-al categories. Although the focus of both these papers are set to review scheduling problems in manufacturing, the results are not restricted to machine scheduling problem and the results can be extended to the second part of the thesis. General drawbacks of literature reviews are identi-fied and several suggestions for future researches are also provided in both papers.
The third paper in the first part of the thesis presents the results of 105 new heuristic algorithms developed to minimize total flow time of a set of jobs in a flowshop manufacturing environ-ment. The computational experiments confirm that the best heuristic proposed in this paper im-proves the average error of best existing algorithm by around 25 percent.
The first paper in second part is focused on minimizing number of electric tow-trains responsi-ble to deliver spare parts from warehouse to the production lines. Together with minimizing number of these electric vehicles the paper is also focused to maximize the work load balance among the drivers of the vehicles. For this problem, after analyzing the complexity of the prob-lem, an opening heuristic, a mixed integer linear programing (MILP) model and a taboo-search neighborhood search approach are proposed. Several managerial insights, such as the effect of battery capacity on the number of required vehicles, are also discussed.
The second paper of the second part addresses the problem of preparing unit loaded devices (ULDs) at air cargos to be loaded latter on in planes. The objective of this problem is to mini-mize number of workers required in a way that all existing flight departure times are met and number of available places for building ULDs is not violated. For this problem, first, a MILP model is proposed and then it is boosted with a couple of heuristics which enabled the model to find near optimum solutions in a matter of 10 seconds. The paper also investigates the inherent tradeoff between labor and space utilization as well as the uncertainty about the volume of cargo to be processed.
The last paper of the second part proposes an integrated model to improve both ergonomic and economic performance of manual order picking process by rotating pallets in the warehouse. For the problem under consideration in this paper, we first present and MILP model and then pro-pose a neighborhood search based on simulated annealing. The results of numerical experiment indicate that selectively rotating pallets may reduce both order picking time as well as the load on order picker, which leads to a quicker and less risky order picking process