Test scheduling for core-based systems using mixed-integer linear programming
نویسندگان
چکیده
منابع مشابه
Test scheduling for core-based systems using mixed-integer linearprogramming
We present optimal solutions to the test scheduling problem for core-based systems. Given a set of tasks (test sets for the cores), a set of test resources (e.g., test buses, BIST hardware) and a test access architecture, we determine start times for the tasks such that the total test application time is minimized. We show that the test scheduling decision problem is equivalent to the -processo...
متن کاملAccepted for Publication in Ieee Transactions on Computer-aided Design of Integrated Circuits and Systems Test Scheduling for Core-based Systems Using Mixed-integer Linear Programming
We present optimal solutions to the test scheduling problem for core-based systems. Given a set of tasks (test sets for the cores), a set of test resources (e.g. test buses, BIST hardware) and a test access architecture, we determine start times for the tasks such that the total test application time is minimized. We show that the test scheduling decision problem is equivalent to the m-processo...
متن کاملRepetitive construction processes scheduling using mixed-integer linear programming
Many construction projects contain several identical or similar units, such as floors in multistory buildings, houses in housing developments, sections of pipelines or highways. Repetitive processes arise from the subdivision of a generalized construction process into specific activities associated with particular units. In many cases it is possible to perform individual processes (repeated in ...
متن کاملSolving the Installation Scheduling Problem Using Mixed Integer Linear Programming
for installing a large number of sizes and types of items (e.g., machines) over time so as to optimize some measure (e.g., initial capital investment), subject to various resource constraints. Examples of this problem are scheduling the installation of point-of-sale terminals in supermarket and retail chains, and teller terminals in banks. We have formulated the installation scheduling problem ...
متن کاملTrajectory Optimization using Mixed-Integer Linear Programming
This thesis presents methods for finding optimal trajectories for vehicles subjected to avoidance and assignment requirements. The former include avoidance of collisions with obstacles or other vehicles and avoidance of thruster plumes from spacecraft. Assignment refers to the inclusion of decisions about terminal constraints in the optimization, such as assignment of waypoints to UAVs and the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 2000
ISSN: 0278-0070
DOI: 10.1109/43.875306