Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing

Article Abstract:

Research is presented concerning the use of a simulated annealing algorithm as a means of resolving scheduling problems occurring in the multipurpose batch processing plant owned by a pharmaceutical company.

Production management, Management, Pharmaceutical industry, Batch processing, Production standards

---

Scheduling with target start times

Article Abstract:

The single machine problem of scheduling n independent jobs with target start times, is addressed.

Methods

---

Local search algorithms for the multiprocessor flow shop scheduling problem

Article Abstract:

Research is presented concerning the review and adaptation of job shop and flow shop local search methods for use in solving a scheduling problem in a multiprocessor flow shop. Simulated annealing and variable-depth search are discussed.

Multiprocessing

Similar abstracts:

• Abstracts: Scheduling about a common due date with job dependent asymmetric earliness and tardiness penalties. A genetic algorithm for scheduling staff of mixed skills under multi-criteria
• Abstracts: Club Med takes a return route into the red; horizon is bleak. Club Med shares drop after release of profit warning
• Abstracts: Deutsche Telekom, Cable & Wireless see shares soar on report of deal. France Telecom Sells Stake In German Rival for C3.1 Billion
• Abstracts: Solving an assignment-selection problem with verbal information and using genetic algorithms. Economic expectations, fuzzy sets and financial planning
• Abstracts: The multi-mode resource-constrained project scheduling problem with generalized precedence relations. An effective implementation of the Lin-Kernighan traveling salesman heuristic

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