Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES

## Package ifs.example.jobshop

JobShop Problem.

See:
Description

Class Summary
Job | Job constraint.
JobShopModel | Job Shop model.
Location | Location of an operation.
Machine | Machine constraint.
Operation | Operation.
Test | Test of Job Shop problem.

## Package ifs.example.jobshop Description

JobShop Problem.
The Job-shop scheduling problem (n,m,J,Cmax) is concerned with ordering n jobs on m machines: each job is composed of an ordered list of m operations and must be processed during a uninterrupted time period of a given length on each of the m machines. The objective is to minimise the makespan, i.e., the maximum of job completion times.

Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES

Copyright © 2005 Tomáš Müller