A genetic algorithm for service level based vehicle scheduling

Article Abstract:

Genetic algorithms (GA) have features that can effectively provide good quality scheduling solutions for the service level based vehicle scheduling problem. These include ease of implementation through efficient coding of solution alternatives, simultaneous emphasis on global and local search and the use of randomization in the search process. A GA is usually associated with interactive methods by replicating the positive attributes of existing solutions in the search process.

Research, Management, Vehicles, Traveling-salesman problem

---

Algorithm for minimizing weighted earliness penalty in single-machine problem

Article Abstract:

A new effective heuristic for solving the single-machine scheduling problem with weighted earliness penalty is developed. The new heuristic is based on the local optimality properties of jobs. This single-machine scheduling problem arises when the objective is to minimize the weighted earliness penalty subject to no tardy jobs. Heuristic algorithms are practical for solving this class of problems when 15 or more jobs are involved due to large computational times.

Design and construction, Algorithm, Heuristic, Heuristics

---

Similar abstracts:

• Abstracts: Greener coatings for steelwork. Fire in the pipeline
• Abstracts: An iterative algorithm for scheduling UET tasks with due dates and release times. Insertion techniques for static and dynamic resource-constrained project scheduling
• Abstracts: Resource levelling for projects with schedule-dependent time windows. A framework for ex ante project risk assessment based on absorptive capacity
• Abstracts: Scheduling multiprocessor tasks on parallel processors with limited availability. An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints

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