Minimizing the weighted number of tardy jobs on parallel processors

Article Abstract:

Minimization of the weighted number of tardy jobs that occurs on either identical or non-identical parallel processors can be done using a branch-and-bound algorithm, which is developed from surrogate-relaxation.

Branch and bound algorithms, Parallel processing

---

Minimizing the weighted number of tardy jobs on a single machine with release dates

Article Abstract:

Application of combinatorial optimization techniques with surrogate relaxation, during derivation of branch and bound algorithms for scheduling of jobs for single machine in manufacturing firm, is described.

United States, Kuwait, Design and construction, Combinatorial optimization, Production planning

---

Minimizing the weighted number of tardy jobs on a single machine

Article Abstract:

An exact algorithm for addressing the problem of weighted number of tardy jobs on a single machine in production processes is presented.

Europe, General services, Production Management, Evaluation, Machinery, Maintenance and repair, Magneto-electric machines

Similar abstracts:

• Abstracts: Engaging the US with trade. Asia drags down the free trade cause. The sent-away kids
• Abstracts: An end to the uncertainty? Small projects 2005
• Abstracts: Timing of entry and the foreign subsidiary performance of Japanese firms. A resource-based model of market learning in the subsidiary: the capabilities of exploration and exploitation
• Abstracts: Managerial assessments of export performance: conceptual framework and empirical illustration. Export market expansion strategies of direct-selling small and medium-sized firms: implications for export sales management activities
• Abstracts: Developing global segments and forecasting market shares: a simultaneous approach using survey data. Determinants of Korean and Japanese new product performance: an inter-relational and process view

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