NOVEL BUCKET-INDEXED MATHEMATICAL MODEL FOR THE LINEAR AND QUADRATIC JUST-IN-TIME SCHEDULING PROBLEMS

Vol 57, 2025 - 340868
Complete Articles (CA)
Favorite this paper
How to cite this paper?
Abstract

This research presents a bucket indexed (BI) formulation for the just-in-time single machine scheduling problem with quadratic objective functions and no-idle constraints. Unlike classical time indexed  models, which discretize the planning horizon into unit periods and often lead to large formulations, the proposed BI approach aggregates consecutive periods into larger intervals, reducing the number of variables and constraints while preserving the scheduling structure. The study compares the computational performance of linear and quadratic objective functions within the BI framework, focusing on the trade-off between solution quality and computational efficiency. The quadratic objective penalizes large deviations from due dates more severely, promoting balanced earliness and tardiness, while the no-idle constraint ensures continuous machine operation, reflecting realistic manufacturing environments. Computational experiments and statistical analyses on instances of varying sizes are conducted to evaluate the proposed approaches. The results aim to provide insights into efficient optimization techniques for single machine production scheduling problems.

Share your ideas or questions with the authors!

Did you know that the greatest stimulus in scientific and cultural development is curiosity? Leave your questions or suggestions to the author!

Sign in to interact

Have a question or suggestion? Share your feedback with the authors!

Institutions
  • 1 Universidade Federal de São Carlos
  • 2 Universidade Federal de São Carlos - UFSCar
Track
  • AD&GP – Operations Research in Production Management and Administration
Keywords
scheduling
single machine scheduling
bucket indexed formulation
quadratic objective function
no-idle constraint