Heuristic algorithms for multiprocessor task scheduling on a two-stage hybrid flow-shop

Article Abstract:

Heuristic algorithms for a two-stage flow-shop scheduling problem with multiprocessor tasks to minimize the makespan are proposed. The performance of the heuristic algorithms is analyzed by a computational experiment using randomly generated problem instances and the result suggests that these heuristic algorithms are both efficient and effective.

Multiprocessors, Multiprocessor computers

---

On scheduling around large restrictive common due windows

Article Abstract:

The three meta-heuristics approaches, which examine common due date scheduling problem on a single machine, are presented.

Germany, Production planning

---

An improved precedence rule for single machine sequencing problems with quadratic penalty

Article Abstract:

A new heuristic for the single machine job sequencing problem is considered.

Heuristics

Similar abstracts:

• Abstracts: Acoustics are difficult. When does a building cross the heritage time line? It may be good enough for Jane Austen, but how much is it worth?
• Abstracts: An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts. Expected utility maximization of optimal stopping problems
• Abstracts: A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem
• Abstracts: An iterative procedure for reducing problem size in large scale AHP problems. Minimizing makespan subject to minimum total flow-time on identical parallel machines
• Abstracts: Yacht velocity prediction using mathematical programming. Minimizing number of tardy jobs on a batch processing machine with incompatible job families

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