A procedure for the one-machine sequencing problem with dependent jobs

Article Abstract:

Complex multi-machine problems have been solved extensively using the one-machine sequencing problem. Such problems generated job dependencies that created machine makespan minimization problems. A solution method based on Carlier's algorithm is developed to generate exact algorithm solutions with optimal job computing times. The method offered efficient solutions for cases describing minimal duration between dependent jobs.

Research, Combinatorial optimization

---

Minimizing late jobs in the general one machine scheduling problem

Article Abstract:

The problem of how to minimize the number of late jobs on a single machine given release dates and widely varying due dates is analyzed. An efficient lower bound procedure with an outcome independent of the coefficient in the original formulation is also proposed. Comparison of the lower bound and the heuristic shows that the latter is faster and much more efficient. Suggestions for future research are presented.

Models

---

Genetic algorithms to minimize the weighted number of late jobs on a single machine

Article Abstract:

A genetic algorithm (GA) is designed to test various engines and several crossover operators. The first metaheuristic for a NP-Hard one-machine scheduling problem is discussed.

Analysis, Usage, Evaluation, Machine theory, Genetic algorithms

Similar abstracts:

• Abstracts: Approximation algorithms for three-dimensional assignment problems with triangle inequalities. Modeling and solving the periodic maintenance problem
• Abstracts: A fuzzy-linguistic approach to a multi-criteria sequencing problem. Application of a measure of proximity to fuzzy control algorithms
• Abstracts: An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem
• Abstracts: Broad reach for the seventh fleet. Bush ponders a military option. Sometimes we need war
• Abstracts: Bottled up; the market in China is promising and perilous. China red and white. Southern Comfort. Local brews: II

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