Can I read Enhancing CLP branch and bound techniques for scheduling problems on EtoBox?

Enhancing CLP branch and bound techniques for scheduling problems by F. Bosi; M. Milano is a Computer Science article available to read on EtoBox.

What is Enhancing CLP branch and bound techniques for scheduling problems about?

In this paper, we propose a constraint logic programming (CLP) approach to the solution of a job shop scheduling problem in the field of production planning in orthopaedic hospital departments. A pure CLP on finite domain (CLP(FD)) approach to the problem has been developed, leading to disappointing results. In fact, although CLP(FD) has been recognized as a suitable tool for solving combinatorial problems, it presents some drawbacks for optimization problems. The main reason concerns the fact that CLP(FD) solvers do not effectively handle the objective function and cost-based reasoning through the simple branch and bound scheme they embed. Therefore, we have proposed an improvement of the standard CLP branch and bound algorithm by exploiting some well-known operations research results. The branch and bound we integrate in a CLP environment is based on the optimal solution of a relaxation of the original problem. In particular, the relaxation used for the job shop scheduling problem considered is the well-known shifted bottleneck procedure considering single machine problems. The idea is to decompose the original problem into subproblems and solve each of them independently. Clearl

Who reads Enhancing CLP branch and bound techniques for scheduling problems?

Author

F. Bosi; M. Milano

Publisher

John Wiley and Sons; Wiley (John Wiley & Sons); John Wiley & Sons Inc.; Wiley (ISSN 0038-0644)

Published

2001

Language

EN

Field

Computer Science (Physical Sciences)