Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Single-machine scheduling with time windows and earliness/tardiness penalties

Article Abstract:

A static, deterministic single-machine scheduling problem with time windows (STW) and earliness/tardiness penalties has been examined. The problem was found to be NP-hard and then decomposed into subproblems of determining a good job sequence and optimally inserting idle time into a sequence. The apparent urgency, adjacent pairwise interchange and PSK-based heuristics were proposed for the solution of STW.

Author: Koulamas, Christos
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
Shop mathematics

User Contributions:

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

CAPTCHA


Two-machine shop scheduling with zero and unit processing times

Article Abstract:

Three algorithms were developed to address the two machine flow shop and open shop problems. The algorithms developed, which resolve the problems under consideration in O (n log n) time, particularly aim to lessen the weighted mean flow-time of the problems. Solution obtained for the open shop problem is based on the flow shop problem and the two parallel identical machine problem's algorithms.

Author: Lushchakova, Irene N., Kravchenko, Svetlana A.
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


On the complexity of two-machine flowshop problems with due date related objectives

Article Abstract:

An assessment of a flowshop environment was undertaken designed to solve its scheduling problems. The two-machine flowshop problems, which possess due date related criteria, become polynomially solvable upon introduction of restrictions on job processing times and due dates. On the other hand, the two-machine flowshop problems become NP-complete upon moderation of restrictions imposed.

Author: Koulamas, Christos
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


Subjects list: Research, Scheduling (Management), Analysis, Algorithms, Mathematics
Similar abstracts:
  • Abstracts: Audit scheduling with overlapping activities and sequence-dependent setup costs. Solving large scale crew scheduling problems
  • Abstracts: Simultaneous engineering approach to an integrated design and process planning. Evaluating alternative production cycles using the extended fuzzy AHP method
  • Abstracts: Right medicine would help: despite fund overflow, investors may return. Japan is getting a big dose of the Asian economic crisis
  • Abstracts: Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method. part 2
  • Abstracts: Japan changes gear. Hurtling towards paralysis. Views from 2020
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.