Asia-Pacific Journal of Operational Research 

About: Asia-Pacific Journal of Operational Research is an academic journal published by World Scientific. The journal publishes majorly in the area(s): Computer science & Job shop scheduling. It has an ISSN identifier of 0217-5959. Over the lifetime, 993 publications have been published receiving 9179 citations. The journal is also known as: Asia Pacific Journal of Operational Research.

Simulation Optimization: A Review and Exploration in the New Era of Cloud Computing and Big Data

Abstract: Recent advances in simulation optimization research and explosive growth in computing power have made it possible to optimize complex stochastic systems that are otherwise intractable. In the first part of this paper, we classify simulation optimization techniques into four categories based on how the search is conducted. We provide tutorial expositions on representative methods from each category, with a focus in recent developments, and compare the strengths and limitations of each category. In the second part of this paper, we review applications of simulation optimization in various contexts, with detailed discussions on health care, logistics, and manufacturing systems. Finally, we explore the potential of simulation optimization in the new era. Specifically, we discuss how simulation optimization can benefit from cloud computing and high-performance computing, its integration with big data analytics, and the value of simulation optimization to help address challenges in engineering design of complex systems.

Simulated Annealing Cooling Schedules for the School Timetabling Problem

Abstract: This paper describes the use of simulated annealing (SA) for solving the school timetabling problem and compares the performance of six different SA cooling schedules: the basic geometric cooling schedule, a scheme which uses two cooling rates, and four schemes which allow reheating as well as cooling. The first two of these reheating schemes are variants of the basic geometric cooling schedule. The third and fourth reheating schemes incorporate a method to compute the temperature that is used as the reheating point. Extensive computational results, which are performed and described, show that the fourth reheating scheme produces consistently better quality solutions in less time than the solutions produced by the other schemes.

Modelling traffic flows with queueing models: a review

Abstract: In this paper, an overview of different analytic queueing models for traffic on road networks is presented. In the literature, it has been shown that queueing models can be used to adequately model uninterrupted traffic flows. This paper gives a broad review on this literature. Moreover, it is shown that the developed published methodologies (which are mainly single node oriented) can be extended towards queueing networks. First, an extension towards queueing networks with infinite buffer sizes is evaluated. Secondly, the assumption of infinite buffer sizes is dropped leading to queueing networks with finite buffer sizes. The impact of the buffer size when comparing the different queueing network methodologies is studied in detail. The paper ends with an analytical application tool to facilitate the optimal positioning of the counting points on a highway.

Inventory lot-size models under trade credits: a review

Abstract: Since the publication of the Goyal model in 1985, research on the modeling of inventory lot-size under trade credits has resulted in a body of literature. In this paper, we present a review of the advances in inventory literature under conditions of permissible delay in payments since 1985. We classify all related previous articles into five categories based on: (a) without deterioration, (b) with deterioration, (c) with allowable shortage, (d) linked to order quantity, and (e) with inflation. The motivations, extensions and weaknesses of various previous models have been discussed in brief to bring out pertinent information regarding model developments in the past two decades.

Scheduling problems with the effects of deterioration and learning

Abstract: This paper deals with the machine scheduling problems with the effects of deterioration and learning. In this model the processing times of jobs are defined as functions of their starting times and positions in a sequence. We introduce polynomial solutions for some single machine problems and flow shop problems. The performance measures include makespan, total completion time, total weighted completion time, and maximum lateness.