Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/325781 
Year of Publication: 
2024
Citation: 
[Journal:] Operations Research Perspectives [ISSN:] 2214-7160 [Volume:] 12 [Article No.:] 100299 [Year:] 2024 [Pages:] 1-15
Publisher: 
Elsevier, Amsterdam
Abstract: 
This paper proposes a novel method of Pareto front generation from a set of piecewise linear trade-off curves typically encountered in bi-objective just-in-time (JIT) scheduling problems. We have considered the simultaneous minimization of total weighted earliness and tardiness (TWET) and total flowtime (TFT) objectives in a single-machine scheduling problem (SMSP) with distinct job due dates allowing inserted idle times in the schedules. An optimal timing algorithm (OTA) is presented to generate the trade-off curve between TWET and TFT for a given sequence of jobs. The proposed method of Pareto front generation generates a Pareto-optimal front constituted of both line segments and points. Further, we employ a simple local search method to generate sequences of jobs and their respective trade-off curves, which are trimmed and merged to generate the Pareto-optimal front using the proposed method. Computational results obtained using problem instances of different sizes reveal the efficiency of the proposed OTA and the Pareto front generation method over the state-of-the-art methodologies adopted from the literature.
Subjects: 
Earliness-tardiness objectives
Just-in-time manufacturing
Multi-objective optimization
Pareto front generation
Single-machine scheduling
Total flowtime
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.