Scheduling algorithms for an air conditioner manufacturing system composed of multiple parallel assembly lines

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 387
  • Download : 0
This paper focuses on a scheduling problem in a manufacturing system composed of multiple parallel assembly lines. There are multiple orders to be processed in this system, and each order is specified by the product type, the number of products to be processed, and the due date. Each product is composed of two types of subassemblies, one unit of an external subassembly and one or more units of an internal subassembly. In the system, the parallel assembly lines are not identical, and certain lines are designated for certain product types. We present heuristic algorithms for the scheduling problem with the objective of minimizing total tardiness of orders. For an evaluation of the performance of the suggested algorithms, computational experiments are performed on a number of problem instances and results show that the suggested algorithms work better than the method used in a real manufacturing system.
Publisher
SPRINGER LONDON LTD
Issue Date
2010-12
Language
English
Article Type
Article
Keywords

WEIGHTED COMPLETION-TIME; MINIMIZE TOTAL TARDINESS; JOB-SPLITTING PROPERTY; IDENTICAL MACHINES; BACKWARD APPROACH; UNIFORM MACHINES; PRODUCT TYPES; SETUP TIMES; ORDERS; ENVIRONMENT

Citation

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, v.51, pp.1225 - 1241

ISSN
0268-3768
DOI
10.1007/s00170-010-2692-5
URI
http://hdl.handle.net/10203/98805
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0