Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

An efficient heuristic approach to the scheduling of jobs in a flowshop

Article Abstract:

Proposed heuristic algorithms for flowshop scheduling are compared with existing algorithms. The three new algorithms are designed to keep total flowtime of jobs at a minimum level. Results show that fairly accurate solutions can be derived rapidly due the heuristic nature of the programs which are computationally simple. Ultimately, scheduling expenses are reduced since the heuristics minimize idle time spent in each stage along with the waiting time for jobs.

Author: Rajendran, Chandrasekharan, Chaudhuri, Dipak
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1992
Research, Software, Employment, Heuristic programming

User Contributions:

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

CAPTCHA


A multi-stage parallel-processor flowshop problem with minimum flowtime

Article Abstract:

A branch-and-bound algorithm is used to generate an optimal permutation schedule for the multi-stage flowshop with parallel processors. Applications of the model facilitate and minimize solving time for parallel-processor problems. The conditions of the flowshop scheduling problem allow the creation of a heuristic model for a two-stage parallel processor flowshop which approximate the optimal solutions obtained from the branch-and-bound algorithm.

Author: Rajendran, Chandrasekharan, Chaudhuri, Dipak
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1992
Models, Usage, Branch and bound algorithms, Parallel processing

User Contributions:

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

CAPTCHA


Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times

Article Abstract:

Efficient heuristics are presented for scheduling jobs in a static flowshop with sequence-dependent setup times with an aim to minimize the sum of weighted flowtime and weighted tardiness of jobs. It is concluded that the proposed heuristics are computationally faster and more effective in yielding solutions of better quality than the benchmark procedures.

Author: Rajendran, Chandrasekharan, Ziegler, Hans
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2003
Management dynamics, Machine Job Shops, Machine Shops, Industrial machinery, not elsewhere classified, Analysis, Company business management, Sequences (Mathematics), Heuristic, Heuristics (Psychology)

User Contributions:

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

CAPTCHA


Subjects list: Management, Scheduling (Management)
Similar abstracts:
  • Abstracts: Dion goes solo in Que. Tourism ads. In the swim of things. Online social politics
  • Abstracts: Understanding B2B and the web: the acceleration of coordination and motivation. The impact of the Internet on the distribution value chain: the case of the South African tourism industry
  • Abstracts: In your face. The surprising lure of fishing. Xbox'x inner workings
  • Abstracts: Neighbour's interests: China and Thailand to mediate in Burma's civil war. Military guns silent
  • Abstracts: A test on a priori financial characteristics of the firm. Time-series distributional properties of financial ratios: empirical evidence from Finnish listed firms
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.