In this paper, we consider a single-machine common due-window assignment scheduling problem with deteriorating jobs. Jobs’ processing times are defined by function of their starting times and job-dependent deterioration rates that are related to jobs and are not all equal. The objective is to determine an optimal combination of sequence and common due-window location so as to minimize the weighted sum of earliness, tardiness and due-window location penalties. We propose an O(n2 log n) time algorithm to solve the problem and discuss several instances to illustrate it.
No takes yet. Share an insight, caveat, or question.
Liu et al. (2013) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: