Priority rules for job shops with weighted tardiness costs
Management Science
Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
Heuristics for scheduling unrelated parallel machines
Computers and Operations Research
Minmax earliness/tardiness scheduling in identical parallel machine system using genetic algorithms
ICC&IE '94 Proceedings of the 17th international conference on Computers and industrial engineering
Exact and approximation algorithms for makespan minimization on unrelated parallel machines
Discrete Applied Mathematics
Scheduling parallel machines to minimize total weighted and unweighted tardiness
Computers and Operations Research
Improved approximation schemes for scheduling unrelated parallel machines
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Exact and Approximate Algorithms for Scheduling Nonidentical Processors
Journal of the ACM (JACM)
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
Journal of the ACM (JACM)
Algorithms for Scheduling Tasks on Unrelated Processors
Journal of the ACM (JACM)
Parallel machine scheduling with earliness and tardiness penalties
Computers and Operations Research
Multiobjective Scheduling by Genetic Algorithms
Multiobjective Scheduling by Genetic Algorithms
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Response Surface Methodology: Process and Product in Optimization Using Designed Experiments
Response Surface Methodology: Process and Product in Optimization Using Designed Experiments
Approximating Scheduling Unrelated Parallel Machines in Parallel
Computational Optimization and Applications
Solving Parallel Machine Scheduling Problems by Column Generation
INFORMS Journal on Computing
Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines
INFORMS Journal on Computing
Scheduling unrelated parallel machines to minimize total weighted tardiness
Computers and Operations Research
Scheduling Algorithms
Convex programming for scheduling unrelated parallel machines
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Parallel machine selection and job scheduling to minimize machine cost and job tardiness
Computers and Operations Research
Computers and Operations Research
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
Theoretical Computer Science
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Simulated Annealing Algorithm for the Weighted Unrelated Parallel Machines Problem
CERMA '09 Proceedings of the 2009 Electronics, Robotics and Automotive Mechanics Conference (cerma 2009)
Unrelated parallel machine scheduling using local search
Mathematical and Computer Modelling: An International Journal
Mathematical and Computer Modelling: An International Journal
A decomposition algorithm for the single machine total tardiness problem
Operations Research Letters
Convergence analysis of canonical genetic algorithms
IEEE Transactions on Neural Networks
Sequence-dependent group scheduling problem on unrelated-parallel machines
Expert Systems with Applications: An International Journal
An artificial bee colony algorithm for the unrelated parallel machines scheduling problem
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
Computers and Operations Research
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.01 |
This research compares the performance of various heuristics and one metaheuristic for unrelated parallel machine scheduling problems. The objective functions to be minimized are makespan, total weighted completion time, and total weighted tardiness. We use the least significant difference (LSD) test to identify robust heuristics that perform significantly better than others for a variety of parallel machine environments with these three performance measures. Computational results show that the proposed metaheuristic outperforms other existing heuristics for each of the three objectives when run with a parameter setting appropriate for the objective.