A dominant subset of V-shaped sequences for a class of single machine sequencing problems
Article Abstract:
A subset of V-shaped sequences which generalize 'V-shaped about d' sequences, known as 'V-shaped about T,' is introduced. It provides information about the absolute position of the shortest job within the time domain, making it more informative than the set of V-shaped sequences. A condition wherein this subset contains an optimal sequence for a class of single machine sequencing problems is defined. A similar condition wherein a shortest possible time job ordering is optimal is also derived.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
User Contributions:
Comment about this article or add new information about this topic:
Single machine scheduling with coefficient of variation minimization
Article Abstract:
A heuristic model for scheduling jobs on a single machine while minimizing the coefficient of variations in job completion times is presented. The efficiency of the heuristic method is also tested. Results yield explicit optimal schedules for some small values of the number of jobs undertaken on a machine. The V-shaped property as well as other findings on the characterization of an optimal schedule is also proven.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1992
User Contributions:
Comment about this article or add new information about this topic:
Comparing the efficacy of ranking methods for multiple round-robin tournaments
Article Abstract:
A technique to compare the efficacy of a range of multiple round-robin tournament ranking methods is presented.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2000
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem. Load balancing and capacity constraints in a hierarchical location model
- Abstracts: An approximately global optimization method for assortment problems. Dynamic programming using the Fritz-John conditions
- Abstracts: A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem
- Abstracts: Dynamic control of multicommodity fleet management problems. A comparative evaluation of modeling approaches to the labor shift scheduling problem
- Abstracts: The German market for wine. Wine in Spain