Problem in Schedulling Machines and operations
Problem in Schedulling Machines and operations
(OP)
I need to solve a problem using Integer Programming.
The Problem is a factory with n Operations and m Machines. There are pij times of processing (for operation i and machine j), and every operation can be done in every machine. This is a case of parallel machines
There are precedence relationships within the operations, and one machine only can done one operation at the same time.
Its important to say that there is a planning horizon of H units of time.
The objective is to reduce the necessary time to make all the operations.
Can you help me?
The Problem is a factory with n Operations and m Machines. There are pij times of processing (for operation i and machine j), and every operation can be done in every machine. This is a case of parallel machines
There are precedence relationships within the operations, and one machine only can done one operation at the same time.
Its important to say that there is a planning horizon of H units of time.
The objective is to reduce the necessary time to make all the operations.
Can you help me?





RE: Problem in Schedulling Machines and operations
Don't you start by defining the required operations and the time required for each?
Are you calculating for a flow of parts or a single part?
Have you read The Goal by Goldratt?
Thomas J. Walz
Carbide Processors, Inc.
www.carbideprocessors.com
Good engineering starts with a Grainger Catalog.