<link rel="stylesheet" href="styles.f3b1fba60ec7970c.css">

Publication:
Parallel machine scheduling with additional resources: a lagrangian-based constraint programming approach

Loading...
Thumbnail Image

Departments

Item type:Organizational Unit,

School / College / Institute

Item type:Organizational Unit,

Program

KU-Authors

Organization Authors

Co-Authors

Edis, Emrah B.

Date

Language

Embargo Status

N/A

Journal Title

Journal ISSN

Volume Title

Alternative Title

Abstract

This study deals with an unrelated parallel machine scheduling problem with one additional resource type (e. g., machine operators). The objective is to minimize the total completion time. After giving the integer programming model of the problem, a Lagrangian relaxation problem (LRP) is introduced by relaxing the constraint set concerning the additional resource. A general subgradient optimization procedure is applied to a series of LRPs to maximize the lower bound for the original problem. To generate efficient upper bounds for the original problem, a constraint programming (CP) model is applied by taking the LRP solutions as input regarding the machine assignments. For the problem, a pure CP model is also developed to evaluate its performance. All the solution approaches are evaluated through a range of test problems. The initial computational results show that Lagrangian-based CP approach produces promising results especially for larger problem sizes.

Source

Publisher

Springer

Citation

item.page.haspartof

Source

Integration of AI and or Techniques in Constraint Programming for Combinatorial Optimization Problems

item.page.ispartofseries

item.page.edition

DOI

item.page.datauri

item.page.link

Rights

N/A

Copyrights Note

Rights and licensing

N/A

Endorsement

Review

Supplemented By

Referenced By

Related Patent

Related Goal

Google Scholar
Scholar'da Ara ↗
Bu yayında DOI yok — Altmetric/Dimensions/PlumX/BIP! rozetleri DOI gerektirir.