A genetic Algorithm for the Single Machine Scheduling Problem with Linear Earliness and Quadratic Tardiness Penalties with Consideration of Preemption and Idle Time
In this paper, a non linear mathematical model has been proposed for solving a single machine scheduling problem with a linear earliness and quadratic tardiness cost, where machine idle time and preemptions are allowed. As the model is complex and cannot be solved in polynomial time, it has been ass...
Main Authors: | Mohamad_Bagher Fakhrzad, Mehdi Azimzade |
---|---|
Format: | Article |
Language: | fas |
Published: |
University of Isfahan
2012-06-01
|
Series: | مدیریت تولید و عملیات |
Subjects: | |
Online Access: | http://uijs.ui.ac.ir/jpom/browse.php?a_code=A-10-117-2&slc_lang=en&sid=1 |
Similar Items
-
Minimal Total Weighted Tardiness in Tight-Tardy Single Machine Preemptive Idling-Free Scheduling
by: Romanuke Vadim
Published: (2019-12-01) -
EFFICIENT EXACT MINIMIZATION OF TOTAL TARDINESS IN TIGHT-TARDY PROGRESSIVE SINGLE MACHINE SCHEDULING WITH IDLING-FREE PREEMPTIONS OF EQUAL-LENGTH JOBS
by: Vadim V. Romanuke
Published: (2020-03-01) -
Just-in-time preemptive single machine problem with costs of earliness/tardiness, interruption and work-in-process
by: Mohammad Kazemi, et al.
Published: (2012-04-01) -
The Preemptive Just-in-time Scheduling Problem in a Flow Shop Scheduling System
by: Javad Rezaeian, et al.
Published: (2019-07-01) -
A Single Machine Sequencing Problem with Idle Insert: Simulated Annealing and Branch-and-Bound Methods
by: R. TavakoliMoghadam, et al.
Published: (2008-12-01)