A hybrid method for a parallel-machine scheduling problem

Author

Vignier, Antony ; Sonntag, B. ; Portmann, M.-C.

Author_Institution

ESIAL, Vandoeuvre-les-Nancy, France

Volume

1

fYear

1999

fDate

1999

Firstpage

671

Abstract

The scheduling problem considered consists of determining a feasible schedule when each job is defined with a ready date, a processing time different on each machine and a deadline. They are setup time sequence dependent. The parallel machines are composed of 2 types. The first one is characterized with “cheap” machines, and the second one with “expensive” machines. The objective function is to first find a feasible schedule and then to minimize the cost due to assignment and setup time costs. The method presented in this paper is based on a three-phase heuristic. The first phase is based on an iterative heuristic, the second one on a genetic algorithm and the third one on a branch and bound for post optimization

Keywords

costing; genetic algorithms; iterative methods; production control; assignment cost; branch and bound; costing; genetic algorithm; heuristic; iterative method; job scheduling; objective function; optimization; parallel-machine; production control; setup time cost; Cost function; Genetic algorithms; Iron; Job production systems; Job shop scheduling; Matrix decomposition; Parallel machines; Steel;

fLanguage

English

Publisher

ieee

Conference_Titel

Emerging Technologies and Factory Automation, 1999. Proceedings. ETFA '99. 1999 7th IEEE International Conference on

Conference_Location

Barcelona

Print_ISBN

0-7803-5670-5

Type

conf

DOI

10.1109/ETFA.1999.815418

Filename

815418