Loading...
Please wait, while we are loading the content...
Similar Documents
Due-date assignment and parallel-machine scheduling with deteriorating jobs∗.
| Content Provider | CiteSeerX |
|---|---|
| Author | Cheng, T. C. E. Kang, L. Y. Ng, C. T. |
| Abstract | In this paper we study the problem of scheduling n deteriorating jobs on m identical parallel machines. Each job’s processing time is a nondecreasing function of its start time. The problem is to determine an optimal combination of the due-date and schedule so as to minimize the sum of the due-date, earliness and tardiness penalties. We show that this problem is NP-hard, and we present a heuristic algorithm to find near-optimal solutions for the problem. When the due-date penalty is 0, we present a polynomial time algorithm to solve it. Key words: deteriorating jobs; parallel-machine scheduling; due-date |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Parallel-machine Scheduling Due-date Assignment Polynomial Time Algorithm Start Time Job Processing Time Optimal Combination Nondecreasing Function Heuristic Algorithm Near-optimal Solution Tardiness Penalty Due-date Penalty Identical Parallel Machine |
| Content Type | Text |
| Resource Type | Article |
