A heuristic to minimize a quadratic function of job lateness on a single machine

Article Abstract:

A heuristic algorithm was created to resolve a problem of reducing a quadratic function of job lateness on a single machine. The algorithm, which is based on a decision index that was produced from rearranging the objective function, was found to be capable of eliminating problems associated with the algorithms of Gupta and Sen. It was also found to be capable of producing satisfactory results within an acceptable time frame.

Heuristic programming

---

One machine scheduling to minimize the maximum earliness with minimum number of tardy jobs

Article Abstract:

A branch and bound algorithm was formulated to resolve the one-machine scheduling problem. The algorithm specifically intends to lessen the maximum earliness with least number of tardy jobs. Implementation of the algorithm revealed its effectiveness for the problems of up to 25 jobs. Results showed that as the tardiness factor decreases and the problem size increases, the algorithm's computing time rises.

Mathematical optimization, Branch and bound algorithms

---

An exact algorithm for batching and scheduling two part types in a mixed shop: a technical note

Article Abstract:

A dynamic programming algorithm was formulated to resolve a job scheduling problem in a shop composed of three machines. The algorithm specifically aims to determine a batch schedule that can lessen the job makespan in a shop under consideration. Implementation of the algorithm showed its effectiveness in solving the problem optimally in a time polynomial in the number of jobs.

Similar abstracts:

• Abstracts: A genetic approach to the scheduling of preventive maintenance tasks on a single product manufacturing production line
• Abstracts: Determining safety stocks for production planning in uncertain manufacturing. An analytical approach to process planning with rework option
• Abstracts: Dynamic control of a cellular-line production system under variations in the product mix. An empirical analysis of productivity and complexity for flexible manufacturing systems
• Abstracts: Can I have sloping limits? The origin of specifications. When do I recalculate my limits?
• Abstracts: Despite financial woes, Japan's spending on science and technology increases and reforms continue. Japan's industrial R&D spending revives, as rising international competition puts premium on research

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