Free Access
Study on Due-Date Assignment Scheduling with Setup Times and General Truncated Learning Effects
https://doi.org/10.1142/S0217595923500069Cited by:0 (Source: Crossref)
Abstract
This paper concentrates on the single-machine scheduling problem with past-sequence-dependent setup times and general truncated learning effects, where the job processing times are non-increasing function of their positions in a sequence. Under common, slack and different (unrestricted) due-date assignments, our goal is to minimize the weighted sum of number of early/tardy jobs and due-date assignment cost, where the weight is not related to the job but to a position, i.e., the position-dependent weight. Under the three due-date assignments, some optimal properties and three optimal solution algorithms are proposed to solve these problems, respectively.
