This paper was published through Galoá and has a deposited DOI. To cite this paper, use one of the standards below:
In case you are one of the co-authors and want to register this paper in your Lattes, use the following code: doi > 10.59254/sbpo-2026-232753
If you've NEVER registered a DOI in your Lattes, check our tutorial!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.
With nearly 200,000 papers published, Galoá empowers scholars to share and discover cutting-edge research through our streamlined and accessible academic publishing platform.
Learn more about our products:
This proceedings is identified by a DOI , for use in citations or bibliographic references. Attention: this is not a DOI for the paper and as such cannot be used in Lattes to identify a particular work.
Check the link "How to cite" in the paper's page, to see how to properly cite the paper