A genetic algorithm for scheduling staff of mixed skills under multi-criteria

Article Abstract:

The problem of scheduling staff with mixed skills is considered.

User Contributions:

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

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code:

A tight lower bound for the completion time variance problem

Article Abstract:

A new and tight lower bound on the mean completion time for optimal job sequences was derived for the completion time variance problem. The latter, an NP-hard problem that arises in a manufacturing environment, involves the scheduling of jobs with different processing times on a single machine under the constraints that job splitting and preemption are not permitted.

User Contributions:

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

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code:

Scheduling about a common due date with job dependent asymmetric earliness and tardiness penalties

Article Abstract:

The problem of scheduling n jobs on a single machine to minimize total earliness and tardiness penalty under a uniform due date is investigated. A general model in which earliness penalty and tardiness penalty are arbitrary non-decreasing functions is developed. In the model, earliness and tardiness are penalized with different job-dependent weights, and the earliness penalty consists of a variable cost and a fixed charge once a job is finished early.

User Contributions:

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

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code: