Sökning: id:"swepub:oai:gup.ub.gu.se/181933" >
Scheduling optimiza...
Scheduling optimization of a real flexible job shop including side constraints regarding maintenance, fixtures, and night shifts
-
- Thörnblad, Karin, 1971 (författare)
- Gothenburg University,Göteborgs universitet,Institutionen för matematiska vetenskaper,Department of Mathematical Sciences,Chalmers tekniska högskola,Chalmers University of Technology,University of Gothenburg
-
- Strömberg, Ann-Brith, 1961 (författare)
- 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 (författare)
- 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
-
visa fler...
-
- Almgren, Torgny, 1962 (författare)
- Gothenburg University,Göteborgs universitet,Institutionen för matematiska vetenskaper, matematik,Department of Mathematical Sciences, Mathematics,Chalmers tekniska högskola,Chalmers University of Technology,University of Gothenburg
-
visa färre...
-
(creator_code:org_t)
- 2013
- Engelska.
- Relaterad länk:
-
https://gup.ub.gu.se...
-
visa fler...
-
https://research.cha...
-
visa färre...
Abstract
Ämnesord
Stäng
- We present a generic iterative scheduling procedure for the scheduling of a real flexible job shop, the so-called multitask cell at GKN Aerospace Engine Systems in Sweden. A time-indexed formulation of the problem is presented including side constraints regarding preventive maintenance, fixture availability, and unmanned night shifts. This paper continues the work in [35], with an improvement of the iterative solution procedure and the inclusion of constraints regarding night shifts during which only unmanned processing is allowed. The resulting schedules are compared with schedules constructed using two priority dispatching rules. Computational results show that the gain of including the night shifts constraints is significant and that the methodology developed is able to produce near-optimal schedules for industrial data instances for the coming shift within an acceptable practical time frame.
Ämnesord
- NATURVETENSKAP -- Matematik -- Diskret matematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Discrete Mathematics (hsv//eng)
- NATURVETENSKAP -- Matematik -- Beräkningsmatematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Computational Mathematics (hsv//eng)
- 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 (hsv//swe)
- NATURAL SCIENCES -- Mathematics (hsv//eng)
Nyckelord
- Flexible job shop scheduling problem
- Mixed integer linear programming (MILP)
- Unmanned night shifts
- Fixture availability
- Preventive maintenance
- Priority dispatching rules
- Fixture availability
Publikations- och innehållstyp
- vet (ämneskategori)
- ovr (ämneskategori)