Dynamic heuristics for the generalized job-shop scheduling problem

Authors:
Fatima Ghedjati;Marie-Claude Portmann
Affiliations:
CReSTIC-Reims, Reims Cedex2, France;LORIA, Ecole des mines de Nancy, Nancy Cedex, France
Venue:
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Year:
2009

Citing 11
Cited 1

Simulated annealing: theory and applications

Simulated annealing: theory and applications
An algorithm for solving the job-shop problem

Management Science
A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective

Computers and Operations Research
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)
Scheduling in Computer and Manufacturing Systems

Scheduling in Computer and Manufacturing Systems
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
New local diversification techniques for flexible job shop scheduling problem with a multi-agent approach

Autonomous Agents and Multi-Agent Systems
A hybrid artificial immune algorithm for a realistic variant of job shops to minimize the total completion time

Computers and Industrial Engineering

A meta-heuristic approach to solve a JIT scheduling problem in hybrid flow shop

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes to solve the generalized job-shop scheduling problem by using several original static and dynamic heuristics relying on the machines' potential load. We consider a generalized job-shop problem with unrelated parallel machines which can process the operations of the different jobs and, moreover, any precedence constraints between the operations are allowed. The objective is to minimize the completion date of all the jobs (makespan). This problem is NP-hard. Experimental results using various important randomly generated benchmarks are satisfactory and promising.