Treffer: A genetic algorithm for the batch scheduling with sequence-dependent setup times

Title:
A genetic algorithm for the batch scheduling with sequence-dependent setup times
Source:
Intelligent computing in signal processing and pattern recognition (International Conference on Intelligent Computing, ICIC 2006, Kunming, China, August 16-19, 2006)0ICIC 2006. :1137-1144
Publisher Information:
Berlin: Springer, 2006.
Publication Year:
2006
Physical Description:
print, 8 ref 1
Original Material:
INIST-CNRS
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
College of Information Technology Science, Nankai University, Tianjin, 300071, China
Department of Manufacturing Engineering & Engineering Management, City University of Hong Kong, Hong-Kong
ISSN:
0170-8643
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Operational research. Management
Accession Number:
edscal.18315963
Database:
PASCAL Archive

Weitere Informationen

This paper considers a single machine scheduling problem with sequence-dependent setup times to minimize the maximum lateness. A genetic algorithm is developed in which an effective binary coding based on the problem properties is presented, and a heuristic for sequencing the batches given the batching structure is proposed. Computational experiments show that the proposed genetic algorithm performs well in solving the problem, and is capable of effectively solving large problems involving 400 jobs.