论文信息 - The metaheuristic GRASP as an upper bound for a branch and bound algorithm in a scheduling problem with non-related parallel machines and sequence-dependent setup times

The metaheuristic GRASP as an upper bound for a branch and bound algorithm in a scheduling problem with non-related parallel machines and sequence-dependent setup times

This paper approaches a scheduling problem with parallel non-related machines, sequencedependent setup times, due dates, weighted jobs and eligibility constraints. A branch and bound algorithm (B&B) is developed and a solution provided by the metaheuristic GRASP is used as an upper bound. Instances are generated and solved by the B&B. The results are compared to the solutions found by the MILP solver XPRESS. The algorithm is shown experimentally to perform very well for problems with up to 17 jobs. A conclusion is shown, and new tests for the full article are proposed.

G. Mateus | P. L. Rocha | G. Ravetti

[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2] Mauricio G. C. Resende,et al. Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[3] Thomas A. Feo,et al. A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties , 1996, Comput. Oper. Res..

[4] Hans-joachim Goltz,et al. Methods for Solving Practical Problems of Job-Shop Scheduling Modelled in CLP(FD) , 1996 .

[5] Peter B. Luh,et al. Job shop scheduling with group-dependent setups, finite buffers, and long time horizon , 1998, Ann. Oper. Res..

[6] Shi-Chung Chang,et al. Scheduling flexible flow shops with sequence-dependent setup effects , 2000, IEEE Trans. Robotics Autom..

[7] Christos Koulamas,et al. Makespan minimization on uniform parallel machines with release times , 2004, Eur. J. Oper. Res..

[8] Mansooreh Mollaghasemi,et al. A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time , 2004, Comput. Oper. Res..

[9] Robin O. Roundy,et al. Capacity-driven acceptance of customer orders for a multi-stage batch manufacturing system: models and algorithms , 2005 .