Article ID Journal Published Year Pages File Type
4631585 Applied Mathematics and Computation 2011 5 Pages PDF
Abstract

This paper studies a single machine scheduling problem simultaneously with deteriorating jobs and learning effects. The objectives are to minimize the makespan and the number of tardy jobs, respectively. Two polynomial time algorithms are proposed to solve these problems optimally.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Applied Mathematics
Preview
Scheduling with deteriorating jobs and learning effects
Authors
, ,