Title: Capacity smoothing and job shop scheduling with backlog carryover and job prioritisation: a case study from the carbon graphite processing industry

Authors: Michael Jahr; Sebastian Fußel

Addresses: Faculty of Business, Economics and Law, TH Cologne, Claudiusstraße 1, 50678 Köln, Germany ' Department for Management, European University of Applied Sciences, Kaiserstraße 6, 50321 Brühl, Germany

Abstract: In this paper, we consider the job shop scheduling problem (JSSP) in single-stage production with n-jobs and m-parallel unrelated machines. We present a specific multi-objective nonlinear binary optimisation model for a real-life case study from the carbon graphite processing industry. In particular, we develop a trade-off objective function with job prioritisation subject to capacity constraints and backlog carryover, implemented in the GAMS standard optimisation software package and solved with the BARON solver. The approach is compared to an adjusted Moore-Hodgson heuristics and the company's existing first come first serve-based procedure. The application of the model on a realistic data set and the analysis of the results validate that the presented approach is efficient.

Keywords: job shop scheduling; binary programming; capacity smoothing; job prioritisation.

DOI: 10.1504/IJOR.2024.139266

International Journal of Operational Research, 2024 Vol.50 No.3, pp.316 - 331

Received: 18 Aug 2021
Accepted: 10 Nov 2021
Published online: 28 Jun 2024 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article