Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/325812 
Year of Publication: 
2025
Citation: 
[Journal:] Operations Research Perspectives [ISSN:] 2214-7160 [Volume:] 14 [Article No.:] 100335 [Year:] 2025 [Pages:] 1-30
Publisher: 
Elsevier, Amsterdam
Abstract: 
This paper studies the simultaneous minimization of total weighted earliness-tardiness (TWET) and makespan in a just-in-time single-machine scheduling problem (JIT-SMSP) with sequence-dependent setup times and distinct due windows, allowing idle times in the schedules. Multiple variants of variable neighbourhood descent (VND) based metaheuristic algorithms are proposed to generate Pareto-optimal solutions for this NP-hard problem. An optimal timing algorithm (OTA) is presented that generates a piecewise linear convex trade-off curve between the two objectives for a given sequence of jobs. The trade-off curves corresponding to the sequences of jobs generated in the proposed metaheuristics are trimmed and merged using a Pareto front generation procedure to generate the Pareto-optimal front comprising line segments and points. The computational performance of the proposed VND-based metaheuristic algorithms is compared with state-of-the-art metaheuristic algorithms from the literature on test instances of varying sizes using four performance metrics devised to compare Pareto fronts comprising line segments and points. The performance comparisons reveal that a proposed variant of backtrack-based iterated VND with multiple neighbourhood structures outperforms the other algorithms in most performance metrics.
Subjects: 
Just-in-time manufacturing
Makespan
Pareto front generation
Single machine scheduling
Total weighted earliness and tardiness
Variable neighbourhood descent
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by-nc-nd Logo
Document Type: 
Article

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.