Development and analysis of cost-based dispatching rules for job shop scheduling

Article Abstract:

The dispatching rules that consider different weights or penalties for flowtime and tardiness of a job are discussed. Many measures of performance related to weighted flowtime and weighted tardiness of jobs are taken into account, and the results of simulation are given.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code:

An alternative framework to Lagrangian relaxation approach for job shop scheduling

Article Abstract:

For job shop scheduling problems, a new Lagrangian relaxation (LR) approach is developed. This new LR approach requires less memory and computation time.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code:

Approximation schemes for job shop scheduling problems with controllable processing times

Article Abstract:

Linear programming models, which are used to find solutions for job shop processing time problems, are presented.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code: