Proceedings ArticleDOI
A hybrid metaheuristic method to minimize cost on non-identical parallel machines
Mohammad Moshref Javadi,Behzad Bankian Tabrizi +1 more
- Vol. 2
Reads0
Chats0
TLDR
A hybrid method based on simulated annealing and genetic algorithm is proposed to solve the problem of scheduling of n jobs on non-identical parallel machines and the results were compared with those obtained by genetic algorithm.Abstract:
The problem of scheduling of n jobs on m non-identical parallel machines is considered. All jobs can be processed on all machines and the processing time and cost of each job depend on the machine on which the job is performed. Jobs cannot be split or divided and all jobs are available at time zero. The goal is to minimize cost which is composed of two parts: earliness-tardiness cost and production cost. The problem is formulated as a MILP model. A hybrid method based on simulated annealing and genetic algorithm is proposed to solve this problem. After parameter tuning of the algorithm, the proposed algorithm was tested on different combinations of jobs and machines and the results were compared with those obtained by genetic algorithm.read more
Citations
References
More filters
Journal ArticleDOI
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
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
Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective
TL;DR: Four search heuristics are proposed to address the problem, namely the earliest weighted due date, the shortest weighted processing time, the two-level batch scheduling heuristic, and the simulated annealing method.
Journal ArticleDOI
Scheduling identical parallel machines to minimize total tardiness
TL;DR: This paper develops and evaluates an efficient heuristic algorithms for finding optimal or near-optimal schedules for the identical parallel-machine problem to minimize total tardiness.
Journal ArticleDOI
Scheduling on parallel identical machines to minimize total tardiness
Sang-Oh Shim,Yeong-Dae Kim +1 more
TL;DR: A branch and bound algorithm is developed using dominance properties and lower bounds as well as upper bounds obtained from a heuristic algorithm for scheduling n independent jobs for the objective of minimizing total tardiness of the jobs.