Loading...
Please wait, while we are loading the content...
Similar Documents
Preemption in Single Machine Earliness / Tardiness Scheduling
| Content Provider | Semantic Scholar |
|---|---|
| Author | Bülbül, Kerem Kaminsky, Philip Yano, Candace |
| Copyright Year | 2002 |
| Abstract | We consider a single machine earliness/tardiness scheduling problem with general weights, ready times and due dates. Our solution approach is based on a time-indexed preemptive relaxation of the problem. For the objective function of this relaxation, we characterize cost coefficients that are the best among those with a piecewise linear structure with two segments. From the solution to the relaxation with these best objective function coefficients, we generate feasible solutions for the original non-preemptive problem. We report extensive computational results demonstrating the speed and effectiveness of this approach. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://ieor.berkeley.edu/~kaminsky/Reprints/KB_PK_CY_07.pdf |
| Alternate Webpage(s) | http://www.ieor.berkeley.edu/~kaminsky/papers/preempt.pdf |
| Alternate Webpage(s) | http://ieor.berkeley.edu/~kaminsky/Reprints/KB_PK_CY_06.pdf |
| Language | English |
| Access Restriction | Open |
| Subject Keyword | Coefficient Computation Index Linear programming relaxation Loss function Optimization problem Piecewise linear continuation Preemption (computing) Scheduling (computing) Scheduling - HL7 Publishing Domain Weight |
| Content Type | Text |
| Resource Type | Article |
