Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

A note on the equivalence of two heuristics to minimize total tardiness

Article Abstract:

The PSK heuristic proposed by S.S. Panwalkar, M. Smith and C.P. Koulamas for solving single machine tardiness problem provides an alternative implementation of the Modified Due Date (MDD) rule developed by K.R. Baker and J.W. Bertrand and based on the shortest processing time and earlier due date models. This explains the good solutions generated by the PSK rule. However, the Wilkerson-Irwin rule is not equivalent to the MDD policy, despite T.C. Cheng's assertion regarding their equivalency.

Author: Alidaee, Bahram, Gopalan, Suresh
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997

User Contributions:

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

CAPTCHA


On minimizing resource consumption with constraints on the makespan and the total completion time

Article Abstract:

The single machine scheduling problem with the objective of minimizing the total resource consumption when the amount of consumed resources depends on the release date of a job is considered. Specifically, Chun-Lun Li's results are extended to the cases of a convex decreasing consumption function and multiple consumption functions to develop conditions for the feasibility of solutions when constraints on the total completion time and the makespan are taken into account.

Author: Vasilev, Stanislav H., Foote, Bob L.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
Resource allocation

User Contributions:

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

CAPTCHA


A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: a case of small common due date

Article Abstract:

The problem of minimizing the weighted absolute deviation of completion times from a common due date in the single-machine scheduling of several batches of multiples jobs is considered. Specifically, the optimality of the largest processing time order is shown to be applicable for cases with a small due date and where the weights of jobs are proportional to processing times. In addition, an algorithm for generating optimal solutions to the problem is described.

Author: Alidaee, Bahram, Dragan, Irinel
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997

User Contributions:

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

CAPTCHA


Subjects list: Research, Scheduling (Management), Production control, Manufacturing processes, Manufacturing
Similar abstracts:
  • Abstracts: In deference of Dad: Deng Xiaoping's son hits out at party hardliners
  • Abstracts: The latest tough breeds of timber products. Changes to structural timber codes. European timber standards: Harmonisation of European timber standards is affecting strength grading, structural design service classes, joint design and load testing
  • Abstracts: Faster by the feeder. No frills and low fares. Jeffrey Katz: new pilot in Swissair's cockpit
  • Abstracts: Asia on the frontier of growth. Asian economies have hit bottom. Private funds for Asia's development
  • Abstracts: The appeal of convertibles: gaining access to Taiwan's pricey market. Hong Kong property shares provide a hedge against yuan devaluation
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.