On preemptive scheduling on unrelated machines using linear programming
We consider a basic preemptive scheduling problem where $ n $ non-simultaneously released jobs are to be processed by $ m $ unrelated parallel machines so as to minimize maximum job completion time. An optimal LP-solution has been used to construct an optimal preemptive schedule for simultaneously r...
Main Author: | Nodari Vakhania |
---|---|
Format: | Article |
Language: | English |
Published: |
AIMS Press
2023-01-01
|
Series: | AIMS Mathematics |
Subjects: | |
Online Access: | https://www.aimspress.com/article/doi/10.3934/math.2023356?viewType=HTML |
Similar Items
-
Branch Less, Cut More and Schedule Jobs with Release and Delivery Times on Uniform Machines
by: Nodari Vakhania, et al.
Published: (2021-03-01) -
Agent Scheduling in Unrelated Parallel Machines with Sequence- and Agent–Machine–Dependent Setup Time Problem
by: Jesús Isaac Vázquez-Serrano, et al.
Published: (2021-11-01) -
Scheduling of jobs and maintenance activities in an unrelated parallel machines environment
by: Abed Hesam, et al.
Published: (2019-09-01) -
Scheduling a Single Machine with Primary and Secondary Objectives
by: Nodari Vakhania
Published: (2018-06-01) -
Unrelated Parallel Machine Scheduling with Job and Machine Acceptance and Renewable Resource Allocation
by: Alexandru-Liviu Olteanu, et al.
Published: (2022-11-01)