Λεπτομέρειες βιβλιογραφικής εγγραφής
| Τίτλος: |
A constraint programming approach for a batch processing problem with non-identical job sizes |
| Συγγραφείς: |
Malapert, Arnaud1,2 arnaud.malapert@mines-nantes.fr, Guéret, Christelle3 christelle.gueret@mines-nantes.fr, Rousseau, Louis-Martin2 louis-martin.rousseau@polymtl.ca |
| Πηγή: |
European Journal of Operational Research. Sep2012, Vol. 221 Issue 3, p533-545. 13p. |
| Θεματικοί όροι: |
*Job analysis, Constraint programming, Batch processing in electronic data processing, Modules (Algebra), Constrained optimization, Mathematical formulas, Mathematical decomposition |
| Περίληψη: |
Abstract: This paper presents a constraint programming approach for a batch processing machine on which a finite number of jobs of non-identical sizes must be scheduled. A parallel batch processing machine can process several jobs simultaneously and the objective is to minimize the maximal lateness. The constraint programming formulation proposed relies on the decomposition of the problem into finding an assignment of the jobs to the batches, and then minimizing the lateness of the batches on a single machine. This formulation is enhanced by a new optimization constraint which is based on a relaxed problem and applies cost-based domain filtering techniques. Experimental results demonstrate the efficiency of cost-based domain filtering techniques. Comparisons to other exact approaches clearly show the benefits of the proposed approach: it can optimally solve problems that are one order of magnitude greater than those solved by a mathematical formulation or by a branch-and-price. [Copyright &y& Elsevier] |
|
Copyright of European Journal of Operational Research is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Βάση Δεδομένων: |
Business Source Index |