JORS 是运筹学协会的官方期刊，发表原创研究论文，涵盖 OR 的理论、实践、历史或方法。

The Journal of the Operational Research Society is the official journal of the Operational Research Society, publishing original research papers that cover the theory, practice, history, and methodology of operational research.

《Journal of the Operational Research Society》是运筹学协会的官方期刊，发表原创研究论文，涵盖运筹学的理论、实践、历史和方法。

Journal of the Operational Research Society

Jatinder N. D. Gupta

Two-Stage, Hybrid Flowshop Scheduling Problem

Steel-making and continuous casting (SCC) processes are considered the main bottlenecks in the steel industry. We consider planning and scheduling problems in SCC processes and provide an overview of the literature with our commentary. The planning problem has as goal to create out of customer orders production units for the various production processes. The scheduling problem assigns these production units to the production facilities over different time intervals. We review a large number of planning and scheduling papers and propose two basic models for the planning and the scheduling problems that incorporate the most common and essential features. We describe for each problem the respective constraints and objectives as well as the practical implications in an actual production environment. We also analyse the methodologies used in their solutions, including decomposition strategies. In the last section, we present the conclusions of our survey and propose new research directions.

Myungho Lee

Kyungduk Moon

Kangbok Lee

Juntaek Hong

Michael Pinedo

A critical review of planning and scheduling in steel-making and continuous casting in the steel industry

钢铁工业中炼钢和连铸计划与调度的关键性综述

We propose new heuristic procedures for the maximally diverse grouping problem (MDGP). This NP-hard problem consists of forming maximally diverse groups—of equal or different size—from a given set of elements. The most general formulation, which we address, allows for the size of each group to fall within specified limits. The MDGP has applications in academics, such as creating diverse teams of students, or in training settings where it may be desired to create groups that are as diverse as possible. Search mechanisms, based on the tabu search methodology, are developed for the MDGP, including a strategic oscillation that enables search paths to cross a feasibility boundary. We evaluate construction and improvement mechanisms to configure a solution procedure that is then compared to state-of-the-art solvers for the MDGP. Extensive computational experiments with medium and large instances show the advantages of a solution method that includes strategic oscillation.

M Gallego

M Laguna

R Martí

A Duarte

Tabu search with strategic oscillation for the maximally diverse grouping problem

Nowadays we are witnessing a transformation of the business processes towards a more computation driven approach. The ever increasing usage of Machine Learning techniques is the clearest example of such trend. This sort of revolution is often providing advantages, such as an increase in prediction accuracy and a reduced time to obtain the results. However, these methods present a major drawback: it is very difficult to understand on what grounds the algorithm took the decision. To address this issue we consider the LIME method. We give a general background on LIME then, we focus on the stability issue: employing the method repeated times, under the same conditions, may yield to different explanations. Two complementary indices are proposed, to measure LIME stability. It is important for the practitioner to be aware of the issue, as well as to have a tool for spotting it. Stability guarantees LIME explanations to be reliable, therefore a stability assessment, made through the proposed indices, is crucial. As a case study, we apply both Machine Learning and classical statistical techniques to Credit Risk data. We test LIME on the Machine Learning algorithm and check its stability. Eventually, we examine the goodness of the explanations returned.

Giorgio Visani

Enrico Bagli

Federico Chesani

Alessandro Poluzzi

Davide Capuzzo

Statistical stability indices for LIME: Obtaining reliable explanations for machine learning models

With increasing public attention on product quality, supply chain quality management has been the focus of considerable research attention in recent years. However, only a few published articles have considered reference effects in supply chain quality management. In practice, reference effects influence consumer purchasing behaviours. Therefore, we have developed a dynamic model that incorporates the effects of the reference quality and reference price on the demand function of a 'single-supplier single-manufacturer' supply chain system. In our model, the demand function is assumed to be influenced by the reference price and reference quality. The reference price formation is assumed to be affected by the gap between quality and the reference quality. By utilizing differential game theory, we calculate and compare the open-loop equilibrium quality levels in two different scenarios: (i) Each channel member makes decisions within a subsidy programme and (ii) the supplier vertically integrates with the manufacturer. In addition, a total cost-sharing contract based on quality improvement efforts is proposed and proven to be effective in the supply chain system that is under consideration.

Yi He

Qingyun Xu

Bing Xu

Pengkun Wu

Supply chain coordination in quality improvement with reference effects

This work addresses the challenge of improving availability and accessibility of maternal healthcare in India by presenting a multi-period planning problem of hierarchical and successively inclusive healthcare facilities. The problem is formulated as a mixed-integer linear programming model to minimize the overall cost, including the cost of establishing and upgrading the facilities, the cost of allocating/referring the mothers-to-be to the respective facilities and the penalty cost of demotivating the overburdening of the facilities in each time period. To solve the model effectively and efficiently, a Bender's Decomposition Algorithm (BDA) with several acceleration strategies such as valid inequalities, disaggregated Benders cuts, rolling horizon heuristic and parallelism is developed. A Bender's type heuristic is also tested by solving the master problem heuristically. Additionally, a Fix-and-Optimize (F&O) heuristic hybridized with Simulated Annealing (SA) enhanced by various search space reduction techniques is developed to obtain good quality solutions in a reasonable time for large instances. It is evident from the results of the computational experiments that the accelerated BDA and Bender type heuristic outperforms Gurobi. The hybrid F&O and SA is observed to be the most computationally efficient approach. A representative scenario in the Indian setting presents further evidence of the model's applicability.

Ankit Chouksey

Anil Kumar Agrawal

Ajinkya N. Tanksale

Accelerated bender’s decomposition algorithm and hybrid heuristics for multi-period planning of maternal healthcare facilities in India

加速的Bender分解算法与混合启发式方法用于印度孕产妇保健设施的多期规划

This article introduces an advanced solution to optimize street sweeping operations by extending a multi-depot arc routing problem. The key enhancement involves flexible end depot assignments, where vehicles start and conclude shifts at designated depots. A notable constraint requires subsequent shifts to begin from the destination depot of the preceding shift. The problem involves servicing highway exclusively during night shifts, while other arc types can be addressed during both day and night. The objective is to identify optimal shifts meeting practical criteria while adhering to constraints like maximum shift duration. To address this, a mixed-integer linear programming (MILP) model is presented. It aims to minimize the number of shifts and total travel time. Given the computational complexity of large instances, an adaptive large neighbourhood search (ALNS) metaheuristic was developed. This approach incorporates specialized operators that address unique attributes such as arc type and depot assignments, ensuring arcs are repositioned based on their type and proximity to depots. This tailored approach provides a distinct advantage over classical ALNS operators, as numerical tests indicate that the specialized operators are more efficient in comparison. The approach is evaluated on larger and a real-world instances, demonstrating notable performance in solution quality and computational efficiency.

Ameni Kraiem

Jean-François Audy

Amina Lamghari

Adaptive large neighbourhood search for the multi-depot arc routing problem with flexible assignment of end depot and different arc types

多仓库弧路由问题的自适应大邻域搜索：终点仓库灵活分配与不同弧类型

The minmax problem for scheduling of group technology with slack due to window assignment under single-machine is investigated. That is, jobs are divided into the same group for continuous processing with similar production characteristics, and resources are allocated to each job to reduce the processing time based on the slack due window of each group, which can be expressed in the form of linear (including compression rate) and convex (including lower bounds on the processing time) functions of the resources, with the objective of minimizing the sum of the maximum slack due window cost (including earliness/tardiness, common flow allowance, and window size) and total resource allocation. Firstly, it is verified that the minimized maximum window cost is polynomial-time solvable for constant processing time. Next, polynomial-time solution algorithms for the target cost are proposed for the special case where the function coefficients are group-position-dependent. Third, for the general case where the coefficients are group-position-independent, an NEH-based heuristic algorithm is proposed, under the consideration of the processing times associated with the two resources, which are used as the upper bound for the branch-and-bound algorithm. Finally, a computational study of the random data is conducted to verify the effectiveness of the proposed algorithms.

Dan-Yang Lv

Ji-Bo Wang

Single-machine group technology scheduling with resource allocation and slack due window assignment including minmax criterion

单机群组技术调度与资源分配及松弛交货期指派，包含极小极大准则

短名	J Oper Res Soc
Journal Impact	2.66
国际分区	OPERATIONS RESEARCH & MANAGEMENT SCIENCE(Q2)
期刊索引	SCI Q2中科院 4 区

ISSN	0160-5682, 1476-9360
h-index	124
国内分区	管理学(4区)管理学运筹学与管理科学(3区)管理学管理学(4区)

涉及主题	计算机科学工程类数学经济运筹学管理业务系统工程运营管理项目管理营销采购数学优化政治学法学操作系统调度（生产过程）管理科学
出版信息	出版商: Taylor and Francis Ltd.，出版周期: Monthly，期刊类型: journal，开源期刊: 否
基本数据	创刊年份: 1978，原创研究文献占比: 98.69%，自引率:14.80%， Gold OA占比: 10.49%
平均审稿周期	网友分享经验：平均7.0个月
平均录用比例	网友分享经验：容易

Journal of the Operational Research Society

期刊引文格式

有 1 位以上作者的期刊

有 2 位作者的期刊

有 3 位作者的期刊

有 5 位以上作者的期刊

书籍引用格式

学位论文引用格式

网页引用格式

专利引用格式

手工熬夜修改参考文献？研飞自动匹配期刊，一键轻松成稿，支持 Word/WPS

投稿经验分享