Abstract
In preemptive scheduling problems, processing of a job can be temporarily interrupted, and resumed at a later time. Conventionally, in the literature on preemptive scheduling, preempted jobs can simply be resumed from the point at which preemption occurred or restart from the beginning. However, this situation may not always be true in practice. It is likely that, in some cases, an imprecise or fuzzy part of jobs processing must be repeated, i.e., a fuzzy time penalty must be incurred. In this paper, we consider the single-machine scheduling problem of minimizing the total flow time subject to job release dates and fuzzy preemption penalties. We present a heuristic algorithm and validate it using some numerical examples.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
