Journal ArticleDOI
Minmax earliness/tardiness scheduling in identical parallel machine system using genetic algorithms
Runwei Cheng,Mitsuo Gen,Mitsuo Tozawa +2 more
- Vol. 29, pp 513-517
TLDR
In this article, the authors address an earliness/tardiness scheduling problem in identical parallel machine system with an objective of minimizing the maximum weighted absolute lateness and apply genetic algorithms to solve this problem.Abstract:
In this paper, we address an earliness/tardiness scheduling problem in identical parallel machine system with an objective of minimizing the maximum weighted absolute lateness. Genetic algorithms are applied to solve this problem. The performance of proposed procedure is compared with exiting heuristic procedure on randomly generated test problems. The results show that the proposed approach performs well for this problem.read more
Citations
More filters
Journal ArticleDOI
A case study in a two-stage hybrid flow shop with setup time and dedicated machines
Hung-Tso Lin,Ching-Jong Liao +1 more
TL;DR: A heuristic is proposed to find the near-optimal schedule for the problem and is beneficial to the company, and it will be implemented in the near future.
Journal ArticleDOI
Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
TL;DR: The problem is to determine a schedule that minimizes a convex combination of makespan and the number of tardy jobs, and heuristic algorithms to solve it approximately are developed.
Journal ArticleDOI
Parallel-machine scheduling to minimize tardiness penalty and power cost
Kuei-Tang Fang,Bertrand M.T. Lin +1 more
TL;DR: A formal formulation, two heuristic algorithms are proposed, and a particle swarm optimization (PSO) algorithm is developed to effectively tackle a scheduling problem in a multiple-machine system where the computing speeds of the machines are allowed to be adjusted during the course of execution.
Journal ArticleDOI
A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
TL;DR: It is found that among the constructive algorithms the insertion-based approach is superior to the others, whereas the proposed SA algorithms are better than TS and genetic algorithms among the iterative metaheuristic algorithms.
Journal ArticleDOI
Electromagnetism-like mechanism and simulated annealing algorithms for flowshop scheduling problems minimizing the total weighted tardiness and makespan
TL;DR: The computational results show that the proposed EM for scheduling the flow shop problem that minimizes the makespan and total weighted tardiness and considers transportation times between machines and stage skipping outperforms SA and other foregoing heuristics applied to this paper.
References
More filters
Book
Adaptation in natural and artificial systems
TL;DR: Names of founding work in the area of Adaptation and modiication, which aims to mimic biological optimization, and some (Non-GA) branches of AI.
Book
Genetic Algorithms + Data Structures = Evolution Programs
TL;DR: GAs and Evolution Programs for Various Discrete Problems, a Hierarchy of Evolution Programs and Heuristics, and Conclusions.
Journal ArticleDOI
Sequencing with Earliness and Tardiness Penalties: A Review
Kenneth R. Baker,Gary D. Scudder +1 more
TL;DR: A framework to show how results have been generalized starting with a basic model that contains symmetric penalties, one machine and a common due date is provided and such features as parallel machines, complex penalty functions and distinct due dates are added.
Journal ArticleDOI
A state-of-the-art review of parallel-machine scheduling research
T.C.E. Cheng,C.C.S. Sin +1 more
TL;DR: The major research results in deterministic parallel-machine scheduling theory will pass a survey and it is revealed that there exist a lot of potential areas worthy of further research.
Journal ArticleDOI
Minimizing flow time variance in a single machine system using genetic algorithms
TL;DR: This paper proposes heuristic procedure based on genetic algorithms with the potential to address more generalized objective function such as weighted flow time variance and some general guidelines to select the parameter values of the genetic algorithm are developed.