Article Title
The Product Test Scheduling Problem
ORCID
0000-0002-8816-3255
Abstract
This research focused on product test scheduling in the presence of in-process and at-completion inspection constraints. Such testing arises in the context of the manufacture of products that must perform reliably in extreme environmental conditions. Often, these products must receive a certification from prescribed regulatory agencies at the successful completion of a predetermined series of tests. Operational efficiency is enhanced by determining the optimal order and start times of tests so as to minimize the makespan while ensuring that technicians are available when needed to complete in-process and at-completion inspections. We refer to this as the product test scheduling problem. We first formulated a mixed-integer linear programming (MILP) model to identify the optimal solution to this problem and solve it using a commercial optimization package. We also present a genetic algorithm (GA) solution methodology that is implemented and solved in Microsoft Excel. Computational results are presented demonstrating the merits and consistency of the MILP and GA solution approaches across a number of scenarios.
Included in
Business Administration, Management, and Operations Commons, Management Sciences and Quantitative Methods Commons, Operational Research Commons, Operations and Supply Chain Management Commons
