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

Article Abstract:

The problem of scheduling staff with mixed skills is considered.

Usage, Combinatorial optimization

---

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.

Operations research, Management science, Case studies, Boundary value problems, Functions of bounded variation, Bounded variation functions

---

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.

Production management

Similar abstracts:

• Abstracts: Ruling on Microsoft may come too late: EU's antitrust decision isn't targeted directly at new operating systems
• Abstracts: An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem
• Abstracts: Random generation of tournaments and asymmetric graphs with given-out degrees. Application of the noising method to the travelling salesman problem
• Abstracts: A memetic algorithm for the total tardiness single machine scheduling problem. Algorithmic approach to the satisfactory graph partitioning problem

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.