Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Preemptive Scheduling of Independent Jobs on Parallel Machines Subject to Financial Constraints

Article Abstract:

The preemptive scheduling of independent jobs on parallel unrelated machinery inclusive of renewable manpower and facilities and money consumption is considered in this research. Financial contraints are a prime consideration. Schedule length and total cost are the principal criteria the algorithm involves the solution of a parametric linear program. It furnishes a satisfactory schedule construct in polynomial time. Feasible schedule job preemptions are also featured in light of their decreasing nature. This research is compared briefly to former research with different resource constraints. Stage iterations are explained, as are two theorems. Diagrams of matrix features are included.

Author: Slowinski, R.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1984
Machinery, Samples (Merchandising), Samples (Products)

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


A two-machine preemptive openshop scheduling problem: an elementary proof of NP-completeness

Article Abstract:

A two-machine preemptive openshop system that is processing a set of jobs with varied ready dates indicates that the scheduling problem of minimizing the mean flow time is strongly NP-complete. The proposed proof scheme has shown that the problem remains NP-hard even if there is the condition of obligatory processing of each job on each machine.

Author: Gladky, A.A.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
Scheduling (Management)

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Quasi-birth-and-death Markov processes with a tree structure and the MMAP[K]/PH[K]/N/LCFS non-preemptive queue

Article Abstract:

The study of a multi-server queueing system with many kinds of users in a last-come-first-served non-preemptive server operation examines the impact of this operation on the queueing process of every kind of user. An algorithm and formulas are developed to enumerate the queue string distributions.

Author: He Qi-Ming
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2000
Telephone and telegraph apparatus, Canada, Communications Processors, Telephone Apparatus Manufacturing, Statistical Data Included, Computer network equipment industry, Network hardware industry, Communications servers, Case studies

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Subjects list: Research, Analysis
Similar abstracts:
  • Abstracts: Cross-frontier broadcasting: and nation shall speak guff unto nation. One more unto the breach
  • Abstracts: Stochastic analysis of a dependent parallel system. A conditional effect of autocorrelated demand on safety stock determination
  • Abstracts: An algorithm for single shift scheduling of hierarchical workforce. Using intelligent agents for pro-active, real-time urban intersection control
  • Abstracts: Matching salesmen to the selling job. A Portfolio Approach to Account Profitability. Applying Territoriality to Steps in the Buyer/Seller Process
  • Abstracts: Inventory Planning in a Deterministic Environment: Continuous Time Model with Concave Costs. On the Convexification of Nonlinear Programming Problems: An Applications-Oriented Survey
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.
Some parts © 2025 Advameg, Inc.