Operational variable job scheduling with eligibility constraints: A randomized constraint‐graph‐based approach

In this study, we consider the problem of Operational Variable Job Scheduling, also referred to as parallel machine scheduling with time windows. The problem is a more general version of the Fixed Job Scheduling problem, involving a time window for each job larger than its processing time. The obje...

Full description

Bibliographic Details
Main Authors: Deniz Türsel Eliiyi, Aslıhan Gizem Korkmaz, Abdullah Ercüment Çiçek
Format: Article
Language:English
Published: Vilnius Gediminas Technical University 2009-06-01
Series:Technological and Economic Development of Economy
Subjects:
Online Access:https://journals.vgtu.lt/index.php/TEDE/article/view/6438