- Title
- A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times
- Creator
- Rocha de Paula, Mateus; Mateus, Geraldo Robson; Ravetti, Martín Gómez
- Relation
- Computers and Operations Research Vol. 37, Issue 5, p. 938-949
- Publisher Link
- http://dx.doi.org/10.1016/j.cor.2009.07.006
- Publisher
- Elsevier
- Resource Type
- journal article
- Date
- 2010
- Description
- Consider the problem of scheduling a set of jobs to be processed exactly once, on any machine of a set of unrelated parallel machines, without preemption. Each job has a due date, weight, and, for each machine, an associated processing time and sequence-dependent setup time. The objective function considered is to minimize the total weighted tardiness of the jobs. This work proposes a non-delayed relax-and-cut algorithm, based on a Lagrangean relaxation of a time indexed formulation of the problem. A Lagrangean heuristic is also developed to obtain approximate solutions. Using the proposed methods, it is possible to obtain optimal solutions within reasonable time for some instances with up to 180 jobs and six machines. For the solutions for which it is not possible to prove optimality, interesting gaps are obtained.
- Subject
- scheduling problems; parallel machines; Lagrangean relaxation; relax-and-cut
- Identifier
- http://hdl.handle.net/1959.13/923208
- Identifier
- uon:9678
- Identifier
- ISSN:0305-0548
- Language
- eng
- Full Text
- Reviewed
- Hits: 1723
- Visitors: 2336
- Downloads: 337
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | ATTACHMENT02 | Author final version | 302 KB | Adobe Acrobat PDF | View Details Download |