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: | , |
|---|---|
| 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 |
| _version_ | 1797718963677822976 |
|---|---|
| author | Mohamad_Bagher Fakhrzad Mehdi Azimzade |
| author_facet | Mohamad_Bagher Fakhrzad Mehdi Azimzade |
| author_sort | Mohamad_Bagher Fakhrzad |
| collection | DOAJ |
| description | 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 assumed to be a NP hard problem, so the known optimal solution methods may not be applicable for its solution. A Genetic Algorithm approach has been developed for solving the model and numerical examples has been presented, which imply that the proposed method is efficient and effective. |
| first_indexed | 2024-03-12T08:57:52Z |
| format | Article |
| id | doaj.art-850da46ab20047368d62001b5d486a50 |
| institution | Directory Open Access Journal |
| issn | 2251-6409 2423-6950 |
| language | fas |
| last_indexed | 2024-03-12T08:57:52Z |
| publishDate | 2012-06-01 |
| publisher | University of Isfahan |
| record_format | Article |
| series | مدیریت تولید و عملیات |
| spelling | doaj.art-850da46ab20047368d62001b5d486a502023-09-02T15:51:46ZfasUniversity of Isfahanمدیریت تولید و عملیات2251-64092423-69502012-06-01316992A genetic Algorithm for the Single Machine Scheduling Problem with Linear Earliness and Quadratic Tardiness Penalties with Consideration of Preemption and Idle TimeMohamad_Bagher Fakhrzad0Mehdi Azimzade1 yazd uni. 2- M.Sc. in Industrial Engineering, Yazd University 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 assumed to be a NP hard problem, so the known optimal solution methods may not be applicable for its solution. A Genetic Algorithm approach has been developed for solving the model and numerical examples has been presented, which imply that the proposed method is efficient and effective.http://uijs.ui.ac.ir/jpom/browse.php?a_code=A-10-117-2&slc_lang=en&sid=1Single machine Genetic algorithm Linear earliness Quadratic tardiness Machine idle time and preemption |
| spellingShingle | Mohamad_Bagher Fakhrzad Mehdi Azimzade A genetic Algorithm for the Single Machine Scheduling Problem with Linear Earliness and Quadratic Tardiness Penalties with Consideration of Preemption and Idle Time مدیریت تولید و عملیات Single machine Genetic algorithm Linear earliness Quadratic tardiness Machine idle time and preemption |
| title | A genetic Algorithm for the Single Machine Scheduling Problem with Linear Earliness and Quadratic Tardiness Penalties with Consideration of Preemption and Idle Time |
| title_full | A genetic Algorithm for the Single Machine Scheduling Problem with Linear Earliness and Quadratic Tardiness Penalties with Consideration of Preemption and Idle Time |
| title_fullStr | A genetic Algorithm for the Single Machine Scheduling Problem with Linear Earliness and Quadratic Tardiness Penalties with Consideration of Preemption and Idle Time |
| title_full_unstemmed | A genetic Algorithm for the Single Machine Scheduling Problem with Linear Earliness and Quadratic Tardiness Penalties with Consideration of Preemption and Idle Time |
| title_short | A genetic Algorithm for the Single Machine Scheduling Problem with Linear Earliness and Quadratic Tardiness Penalties with Consideration of Preemption and Idle Time |
| title_sort | genetic algorithm for the single machine scheduling problem with linear earliness and quadratic tardiness penalties with consideration of preemption and idle time |
| topic | Single machine Genetic algorithm Linear earliness Quadratic tardiness Machine idle time and preemption |
| url | http://uijs.ui.ac.ir/jpom/browse.php?a_code=A-10-117-2&slc_lang=en&sid=1 |
| work_keys_str_mv | AT mohamadbagherfakhrzad ageneticalgorithmforthesinglemachineschedulingproblemwithlinearearlinessandquadratictardinesspenaltieswithconsiderationofpreemptionandidletime AT mehdiazimzade ageneticalgorithmforthesinglemachineschedulingproblemwithlinearearlinessandquadratictardinesspenaltieswithconsiderationofpreemptionandidletime AT mohamadbagherfakhrzad geneticalgorithmforthesinglemachineschedulingproblemwithlinearearlinessandquadratictardinesspenaltieswithconsiderationofpreemptionandidletime AT mehdiazimzade geneticalgorithmforthesinglemachineschedulingproblemwithlinearearlinessandquadratictardinesspenaltieswithconsiderationofpreemptionandidletime |