Capacity smoothing and job shop scheduling with backlog carryover and job prioritisation: a case study from the carbon graphite processing industry
by Michael Jahr; Sebastian Fußel
International Journal of Operational Research (IJOR), Vol. 50, No. 3, 2024

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.

Online publication date: Fri, 28-Jun-2024

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com