Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Minimizing maximum lateness with job families

Article Abstract:

Research is presented concerning the scheduling of jobs on a single machine in a way which provides an optimal solution procedure. The establishment of job families and the minimization of maximum lateness are discussed.

Author: Baker, Kenneth R., Magazine, Michael J.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2000
Methods

User Contributions:

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

CAPTCHA


Comparison of neural and heuristic methods for a timetabling problem

Article Abstract:

The performances of an annealed neural network, a graph coloring heuristic and a pricing out heuristic in solving a timetabling problem known as the interview scheduling problem were compared. Specifically, the nonparametric statistics were employed to evaluate the solutions delivered by the heuristics and the neural network in terms of quality and execution time. The results showed that heuristics are more effective than neural networks because the latter require multiple repetitions.

Author: Magazine, Michael J., Mausser, Helmut E.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
Computer networks, Case studies, Evaluation, Neural networks, Heuristic programming

User Contributions:

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

CAPTCHA


Stochastically minimizing total flowtime in flowshops with no waiting space

Article Abstract:

A study was conducted to analyze the problem of scheduling jobs with the total flowtime performance measure in two-machine flowshops supporting constant and known processing times. Results indicated that the shortest processing time based on the processing time of the jobs on the first machine stochastically reduced the performance criteria provided that it supports a faster counting process than the second machine. Findings also showed that the shortest processing time based on the processing times of the jobs on the second machine reduced the total flowtime stochastically.

Author: Allahverdi, Ali
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1999
Manufacturing processes, Manufacturing, Stochastic processes

User Contributions:

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

CAPTCHA


Subjects list: Operations research, Research, Management science, Analysis, Management, Scheduling (Management)
Similar abstracts:
  • Abstracts: Big Reaction. Giant chemical companies are rushing to keep the start-ups from muscling in on their business. QXL Turns Local Edge In Online Auctions Into Global Advantage
  • Abstracts: Transocean to acquire rival oil firm, solidifing lead in offshore drilling. Patterson agrees to buy UTI for $1.3 billion
  • Abstracts: Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing. Scheduling with target start times
  • Abstracts: Despite online trading threat, securities firms go on hiring spree. Many on Wall Street back Al Gore
  • Abstracts: Microsoft challenges BlackBerry with new mobile-email devices. H-P shares jump by 12% as brokers improve outlook
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.