Production sequencing problem with re-entrant work flows and sequence dependent setup times

Cited 27 time in webofscience Cited 32 time in scopus
  • Hit : 260
  • Download : 0
This paper addresses a shop scheduling problem where a set of n jobs needs to be scheduled on two machines for the side frame press shop in a truck manufacturing company. A most unusual aspect of the problem is that the setup limes required for a job in the first machine depend not on the immediately preceding job but on the job which is two steps prior to it. Redefining the job elements, the problem is formulated into a general two machine flow shop problem which can be solved by dynamic programming with the objective of the minimum makespan. An optimal schedule is found utilizing the sequence dominance conditions and the decision-delay scheme. Since the computational requirements of dynamic programming are impracticably demanding for large-sized problems, a genetic algorithm is developed and its performance is examined through a comparative study.
Publisher
TAYLOR & FRANCIS LTD
Issue Date
1998
Language
English
Article Type
Article
Keywords

SHOP SCHEDULING PROBLEMS; GENETIC ALGORITHMS

Citation

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, v.36, no.9, pp.2435 - 2450

ISSN
0020-7543
DOI
10.1080/002075498192616
URI
http://hdl.handle.net/10203/71125
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 27 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0