Mathematical optimization of a flexible job shop problem including preventive maintenance and availability of fixtures

Paper in proceeding, 2012

The multitask cell at Volvo Aero Corporation is a flexible job shop containing ten resources aimed at being flexible with regard to product mix and processing types. Computing schedules for this type of job shop is an NP-hard problem. The computation times will therefore always be an issue, especially as the scheduling problem includes limited availability of fixtures and preventive maintenance planning. Computational results show that with the method developed we are able to produce optimal, or near-optimal, schedules for real data instances within an acceptable time frame. The scheduling principle proposed shortens lead times and minimizes tardiness.