Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Scheduling jobs on parallel machines with sequence-dependent setup times

Article Abstract:

A three-stage heuristic is employed for lessening the sum of the weighted tardiness in scheduling jobs on parallel machines with sequence-dependent setup times. In the first phase, the processing time of a job is computed. In the second phase, the dispatching rule used seems to work excellently, more so when the schedule is tight. In the third phase, the simulated annealing method can be considerably enhanced if a job with a big setup time in the sequence is chosen.

Author: Pinedo, Michael, Young Hoon Lee
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
Work Schedules, Work hours, Parallel processing

User Contributions:

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

CAPTCHA


Heuristics for the flow line problem with setup costs

Article Abstract:

The lower bound yielded by the improved bounding scheme was adjudged to be slightly better than the linear programming relaxation lower bound. The traveling salesman problem-based heuristic functioned better on the bigger 2-machine instances. Nonetheless, when the number of machines increases, the insertion-based heuristics NEHT-RB() and GRASP() predominated. By raising the iteration counter in GRASP(), additional and perhaps improved solutions can be gleaned.

Author: Bard, Jonathan F., Rios-Mercado, Roger Z.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1998

User Contributions:

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

CAPTCHA


A heuristic for machine scheduling at general mail facilities

Article Abstract:

A heuristic method for establishing operational machine schedules applied to batch processing was developed. A mixed-integer linear program (MILP) model was generated based on the characterisitics of the mail-processing system. Subsequently, the heuristic method was designed to achieve usable schedules from MILP solutions through machines processing mail types in batches of sufficient lengths.

Author: Bard, Jonathan F., Silva, Anura H. de, Jarrah, Ahmad I.Z.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1992
Models, Postal service

User Contributions:

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

CAPTCHA


Subjects list: Research, Usage, Scheduling (Management), Production control, Heuristic programming
Similar abstracts:
  • Abstracts: Audit scheduling with overlapping activities and sequence-dependent setup costs. Solving large scale crew scheduling problems
  • Abstracts: Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method. One-machine job scheduling with non-constant capacity - minimizing weighted completion times
  • Abstracts: Benchmarks for shop scheduling problems. Executing production schedules in the face of uncertainties: a review and some future directions
  • Abstracts: Macronix is scaling back. Vanguard names new CEO
  • Abstracts: Formation and performance of multi-partner joint ventures: a Sino-foreign illustration. The influence of liability of foreignness on market entry strategies: an illustration of market entry in China
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.