Heuristics and a hybrid meta-heuristic for a generalized job-shop scheduling problem
Author:
- 1 July 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 1089778X,p. 1-8
Abstract
This paper proposes to solve a generalized job-shop scheduling problem (with unrelated parallel machines and precedence constraints between the jobs operations) by using, on the one hand, several original static and dynamic heuristics relying on the machines potential load and, on the other hand, an original hybrid genetic algorithm meta-heuristic. The objective is to minimize jobs completion time. Experimental results using different types of data and the comparison of both approaches are reported.Keywords
This publication has 25 references indexed in Scilit:
- Dynamic heuristics for the generalized job-shop scheduling problem2009
- Parallel Machine Scheduling (PMS) in Manufacturing Systems Using the Ant Colonies Optimization Algorithmic RuleJournal of Applied Sciences, 2007
- A hybrid genetic algorithm for the job shop scheduling problemEuropean Journal of Operational Research, 2005
- A Taxonomy of Hybrid MetaheuristicsJournal of Heuristics, 2002
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objectiveComputers & Operations Research, 1994
- Duality-Based Algorithms for Scheduling Unrelated Parallel MachinesINFORMS Journal on Computing, 1993
- Job Shop Scheduling with Tooling Constraints: a Tabu Search ApproachJournal of the Operational Research Society, 1991
- Heuristic “Optimization”: Why, When, and How to Use ItInterfaces, 1981
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979
- Exact and Approximate Algorithms for Scheduling Nonidentical ProcessorsJournal of the ACM, 1976