Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Discrete-continuous scheduling problems - mean completion time results

Article Abstract:

The problem of scheduling independent, nonpreemptable jobs on parallel machines with the objective of minimizing the mean completion time was considered. Specifically, optimal schedules for problems with a continuously divisible, renewable resource and a processing rate that is a continuous, nondecreasing function of the amount of the continuous resource were characterized. Consequently, two special cases of the problem with polynomial solutions were examined.

Author: Weglarz, Jan, Jozefowska, Joanna
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
Operations research, Management science, Case studies

User Contributions:

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

CAPTCHA


Local search metaheuristics for discrete-continuous scheduling problems

Article Abstract:

Three local search metaheuristics were evaluated in terms of addressing discrete-continuous scheduling problems. Computational experiment revealed that the tabu search, the simulated annealing and the genetic algorithm were able to outperform the random sampling technique. The tabu search, meanwhile, was found to be the best metaheuristic in terms of generating the biggest number of optimal solutions and the smallest optimum deviation for all problem sizes.

Author: Mika, Marek, Waligora, Grzegorz, Weglarz, Jan, Jozefowska, Joanna, Rozycki, Rafal
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1998
Evaluation, Heuristic programming, Simulated annealing (Mathematics)

User Contributions:

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

CAPTCHA


On a methodology for discrete-continuous scheduling

Article Abstract:

A general model was developed to illustrate discrete-continuous problems related to nonpreemptable job scheduling. The new model takes into consideration a situation in which job processing rates designated to a machine relies on the amount of a continuously divisible resource. The methodology is also found to be highly applicable to other more general discrete-continuous scheduling problems.

Author: Weglarz, Jan, Jozefowska, Joanna
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1998
Models, Optimization theory, Mathematical programming

User Contributions:

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

CAPTCHA


Subjects list: Research, Scheduling (Management), Mathematics
Similar abstracts:
  • Abstracts: On the complexity of scheduling with large communication delays. A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs
  • Abstracts: Stop the presses, don't print yen; pumping more money into Japan won't solve the credit crunch. Japan can set itself for a productive future
  • Abstracts: An unwelcome adventure. Crash highlights problems Korean Air already had. Air passes offer discounts for regional travelers
  • Abstracts: Scheduling multiprocessor tasks - an overview. Scheduling tasks and communications on a virtual distributed system
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.