Answers are grounded in this paper and cite their sources.
In this article, single‐machine scheduling problems with learning effects of setup and removal times and deterioration effects of processing time are considered. The objective function of the problem is minimization of the weighted sum of total earliness and total tardiness. To get an exact solution to the problem, a mathematical programming model is proposed. Also the model is tested on an example. To the best of our knowledge, no work exists in the literature that considers the problem presented in this article.
No takes yet. Share an insight, caveat, or question.
Tamer Eren (2009) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: