SwePub
Sök i LIBRIS databas

  Extended search

onr:"swepub:oai:gup.ub.gu.se/167036"
 

Search: onr:"swepub:oai:gup.ub.gu.se/167036" > Scheduling optimiza...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Scheduling optimization of a real flexible job shop including fixture availability and preventive maintenance

Thörnblad, Karin, 1971 (author)
Gothenburg University,Göteborgs universitet,Institutionen för matematiska vetenskaper,Department of Mathematical Sciences,University of Gothenburg,Chalmers tekniska högskola,Chalmers University of Technology
Strömberg, Ann-Brith, 1961 (author)
Gothenburg University,Göteborgs universitet,Institutionen för matematiska vetenskaper, matematik,Department of Mathematical Sciences, Mathematics,University of Gothenburg,Chalmers tekniska högskola,Chalmers University of Technology
Patriksson, Michael, 1964 (author)
Gothenburg University,Göteborgs universitet,Institutionen för matematiska vetenskaper, matematik,Department of Mathematical Sciences, Mathematics,University of Gothenburg,Chalmers tekniska högskola,Chalmers University of Technology
show more...
Almgren, Torgny, 1962 (author)
Gothenburg University,Göteborgs universitet,Institutionen för matematiska vetenskaper, matematik,Department of Mathematical Sciences, Mathematics,University of Gothenburg,Chalmers tekniska högskola,Chalmers University of Technology
show less...
 (creator_code:org_t)
2015
2015
English.
In: European Journal of Industrial Engineering. - 1751-5254. ; 9:1, s. 126-145
  • Journal article (peer-reviewed)
Abstract Subject headings
Close  
  • The multitask cell at GKN Aerospace Sweden is a flexible job shop containing ten resources aimed at being flexible with regard to product mix and processing types. We present a time-indexed formulation of the problem of optimally scheduling the planned jobs on the resources, also considering a limited availability of fixtures as well as required preventive maintenance activities. The objective is to minimize a weighted sum of the completion times and tardiness for the jobs, where the tardiness weight for a given job is a non-increasing function of its due date. We propose a fast iterative approach to finding a suitable value of the length of the time horizon that needs to be set for the time-indexed formulation and which considerably influences the computation time. Computational results show that the method developed is able to produce optimal, or near-optimal, schedules for real data instances within an acceptable practical time frame.

Subject headings

TEKNIK OCH TEKNOLOGIER  -- Maskinteknik -- Produktionsteknik, arbetsvetenskap och ergonomi (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Mechanical Engineering -- Production Engineering, Human Work Science and Ergonomics (hsv//eng)
NATURVETENSKAP  -- Matematik -- Beräkningsmatematik (hsv//swe)
NATURAL SCIENCES  -- Mathematics -- Computational Mathematics (hsv//eng)
NATURVETENSKAP  -- Matematik -- Diskret matematik (hsv//swe)
NATURAL SCIENCES  -- Mathematics -- Discrete Mathematics (hsv//eng)
NATURVETENSKAP  -- Matematik (hsv//swe)
NATURAL SCIENCES  -- Mathematics (hsv//eng)

Keyword

production planning
flexible job shop scheduling problem (FJSP)
mathematical optimization
dynamic scheduling
preventive maintenance
fixture availability
time-indexed formulation
objective weights
time horizon
mathematical optimization

Publication and Content Type

ref (subject category)
art (subject category)

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view