Simulated annealing and genetic algorithms for scheduling products with multi-level product structure

Cited 59 time in webofscience Cited 0 time in scopus
  • Hit : 704
  • Download : 0
We consider a short-term production scheduling problem in a manufacturing system producing products with multi-level product structure, and their components and subassemblies. The problem is to schedule production of components, subassemblies, and final products with the objective of minimizing the weighted sum of tardiness and earliness of the items. We consider due dates of final products, precedence relationships among items, and processing capacity of the manufacturing system. The scheduling problem is solved with simulated annealing and genetic algorithms, which are search heuristics often used for global optimization in a complex search space. To compare the performance of these algorithms with the finite loading method, which is often used in practice, computational experiments are carried out using randomly generated test problems and results are reported. Copyright (C) 1996 Elsevier Science Ltd
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
1996-09
Language
English
Article Type
Article
Keywords

MANUFACTURING SYSTEMS; OPTIMIZATION; OPERATIONS; TIME; CELL; QAP

Citation

COMPUTERS OPERATIONS RESEARCH, v.23, no.9, pp.857 - 868

ISSN
0305-0548
URI
http://hdl.handle.net/10203/7531
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 59 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0