An iterative improvement approach for the nonpreemptive open shop scheduling problem

Article Abstract:

An iterative improvement approach based on Bender's decomposition procedure is derived to solve the nonpreemptive open shop scheduling problem. The approach separates the sequencing and scheduling components of the problem to address them individually. A heuristic dispatching rule to obtain general initial feasible solutions is also determined. It is shown that the approach yields solutions that are within 1% of lower bounds.

Management Theory & Techniques, Management, Scheduling (Management)

---

A hybrid genetic algorithm for the open shop scheduling problem

Article Abstract:

A hybrid genetic algorithm was developed for the open shop scheduling problem.

Right to work (Labor unions)

---

A genetic algorithm approach to policy design for consequence minimization

Article Abstract:

An approach to policy planning using a genetic algorithm is proposed.

Similar abstracts:

• Abstracts: A self-organizing neural network approach for the single AGV routing problem
• Abstracts: Network reduction for the acyclic constrained shortest path problem. A directed hypergraph model for random time dependent shortest paths
• Abstracts: Global optimization methods for high-dimensional problems. On a 2-dimensional equipartition problem. Path equipartition in the Chebyshev norm
• Abstracts: EBRD's new president pledges he won't seek major policy changes. German debt dominates issuance
• Abstracts: AUSTRIA: WATCHDOG CALLS FOR LOWER MOBILE RATES. AUSTRIA: GSM FREQUENCY AUCTION DELAYED. Austria: Delays for UMTS

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