A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times

详细信息    查看全文

• 作者：Mateus Rocha de Paula ; Geraldo Robson Mateus ; Martí ; n Gó ; mez Ravetti
• 关键词：Scheduling problems ; Parallel machines ; Lagrangean relaxation ; Relax-and-cut
• 刊名：Computers and Operations Research
• 出版年：2010
• 出版时间：May 2010
• 年：2010
• 卷：37
• 期：5
• 页码：938-949
• 全文大小：195 K

文摘

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.