Open Access
Sequencing and scheduling : algorithms and complexity
Eugene L. Lawler,Jan Karel Lenstra,Ahg Alexander Rinnooy Kan,David B. Shmoys +3 more
- Vol. 4, pp 445
Reads0
Chats0
TLDR
A survey of deterministic machine scheduling can be found in this article, where complexity results and optimization and approximation algorithms for problems involving a single machine, parallel machines, open shops, flow shops and job shops are presented.Abstract:
Sequencing and scheduling as a research area is motivated by questions that arise in production planning, in computer control, and generally in all situations in which scarce resources have to be allocated to activities over time. In this survey, we concentrate on the area of deterministic machine scheduling. We review complexity results and optimization and approximation algorithms for problems involving a single machine, parallel machines, open shops, flow shops and job shops. We also pay attention to two extensions of this area: resource-constrained project scheduling and stochastic machine scheduling.read more
Citations
More filters
Solving the Multi Objective Flexible Job Shop Problem Using Combinational Meta Heuristic Algorithm Based on Genetic Algorithm and Tabu-Search
TL;DR: A combinational optimization Meta heuristic based on Genetic algorithm is proposed for solving this problem and Tabu search method as a local search algorithm is used to increasing the quality of solutions.
Dissertation
Modeling and constructing unstructured overlay networks: Algorithms, techniques and the Smart Grid case
TL;DR: A novel modeling on resource dispatch in power grids that takes into account node preferences and domain-related constraints is presented and it is proved that the algorithm always converges to a solution that provides a guaranteed approximation of the maximum total amount of a link-quality metric called satisfaction.
Journal ArticleDOI
Scheduling memory accesses through a shared bus
Eli Almog,Hadas Shachnai +1 more
TL;DR: This work focuses on the bus architecture, in which a shared bus is used for communication between processors — and between processors and memories, and shows that the bound is tight for all measures, by describing algorithms whose competitive ratios are O(μ/λ).
Proceedings ArticleDOI
Development of a new model for the flowshop problem
TL;DR: In this article, a new mixed integer linear programming model for the regular flow shop scheduling problem is proposed, which is derived from an existing model mathematically, and the model has less number of constraints than the old model, whereas it has more number of variables.
Dissertation
Fully polynomial time approximation schemes for sequential decision problems
TL;DR: A generic approach for devising fully polynomial time approximation schemes for a large class of problems that the authors call list scheduling problems is introduced, and many previous results in the literature follow as direct corollaries of the main theorem.