Single-machine earliness-tardiness scheduling about a common due data with tolerances

Article Abstract:

Both a heuristic and a dynamic programming algorithm are used to solve a particular single-machine problem that involves decreasing to its lowest possible magnitude the mean absolute deviation of job completion times from a common deadline having a variety f tolerance sizes. Computational results for the scheduling problem using the algorithms are optimal and thus make the chosen methodology a good one for solving similar problems.

Usage, Algorithms, Dynamic programming

---

Variable priority dispatching rules: an analytical approach

Article Abstract:

Dispatching rules in production can be classified into sequential rules, priority selection rules (PSR) and variable priority rules (VPR). Sequential rules adopt a first-in-first-out policy, which is strongly influenced by the production process. PSR assigns preference for specific products within the shortest processing time possible, while VPR is similar to PSR but allows changes in priority.

Management, Markov processes, Flexible manufacturing systems

---

Similar abstracts:

• Abstracts: Genetic algorithm approach to earliness and tardiness production scheduling and planning problem. Application of calculus of variations to a continuous time aggregate production model
• Abstracts: Three other Rs: recognition, reward and resentment. Flowing past organizational walls. Internationalizing R and D improves a firm's technical learning
• Abstracts: Operations management of multiple machine automatic warehousing systems. Sequencing picking operations and travel time models for man-on-board storage and retrieval warehousing system

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