A genetic algorithm for JIT single machine scheduling with preemption and machine idle time

Authors:
H. Khorshidian;N. Javadian;M. Zandieh;J. Rezaeian;K. Rahmani
Affiliations:
Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran;Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran;Department of Industrial Management, Management and Accounting Faculty, Shahid Beheshti University, G.C., Tehran, Iran;Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran;Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran
Venue:
Expert Systems with Applications: An International Journal
Year:
2011

Citing 7
Cited 0

Sequencing with earliness and tardiness penalties: a review

Operations Research
The One-Machine Problem with Earliness and Tardiness Penalties

Journal of Scheduling
A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date

Computers and Industrial Engineering
Preemption in single machine earliness/tardiness scheduling

Journal of Scheduling
A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem

Journal of Scheduling
Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey

Mathematical and Computer Modelling: An International Journal
The one-machine just-in-time scheduling problem with preemption

Discrete Optimization

Quantified Score

Hi-index	12.05

Visualization

Abstract

This paper concerns with the concept of preemption in just-in-time single machine scheduling problem, with allowable machine idle time. We proposed a new model, with non-linear terms and integer variables which cannot be solved efficiently for large size problems due to its NP-hardness. To solve the model for real size applications, genetic algorithm is applied. These genetic procedures are also quite close to the optimum and provided an optimal solution for most of the test problems. Numerical examples show that the proposed algorithm is efficient and effective.