Abstract
In this paper we consider a single machine scheduling problem with deteriorating jobs. By deteriorating jobs, we mean that the processing time of a job is a simple linear function of its execution starting time. For the jobs with chain precedence constraints, we prove that the weighted sum of squared completion times minimization problem with strong chains and weak chains can be solved in polynomial time, respectively.
| Original language | English |
|---|---|
| Pages (from-to) | 1765-1770 |
| Number of pages | 6 |
| Journal | Journal of the Operational Research Society |
| Volume | 62 |
| Issue number | 9 |
| DOIs | |
| Publication status | Published - 1 Sept 2011 |
Keywords
- deteriorating jobs
- Scheduling
- single machine
- weighted sum of squared completion times
ASJC Scopus subject areas
- Management Information Systems
- Strategy and Management
- Management Science and Operations Research
- Marketing