Machine Scheduling Problems
Classification, complexity and computations
Page
%P
9 Result(s)
-
Article
Reviews
-
Book
-
Chapter
Introduction
The problems that form the object of this study can be summarized as follows.
-
Chapter
Two-machine and three-machine problems
In this chapter we discuss problems involving two or three machines. We shall be mainly interested in a further exploration of the borderline between ‘easy’ and ‘hard’ problems as discussed in section 3.6. The...
-
Chapter
Concluding remarks
In this final chapter we summarize our results with respect to the complexity of scheduling problems in section 7.1. In section 7.2 we shall indicate how theory and algorithms developed in the previous chapter...
-
Chapter
Methods of solution
In this chapter we examine the better known methods that have been used to solve machine scheduling problems. They will be treated in more or less detail in inverse proportion to the degree to which they reapp...
-
Chapter
Problem formulation
As announced in chapter 1, this chapter deals with various aspects of problem formulation. In section 2.1 we discuss problem representations, including the important disjunctive graph model, and introduce nota...
-
Chapter
One-machine problems
In sections 4.1 to 4.4 we examine the case that the number of machines m is equal to 1.
-
Chapter
General flow-shop and job-shop problems
In this chapter we consider general flow-shop and job-shop problems for which the number m of machines is variable. All these problems can be proved to be NP-complete from results in previous chapters; consequent...
