Optimal schedules for single facility with two job classes (Q1085046): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:08, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal schedules for single facility with two job classes |
scientific article |
Statements
Optimal schedules for single facility with two job classes (English)
0 references
1984
0 references
A single facility scheduling problem with jobs divided into two mutually exclusive classes is considered when the setup time depends on the class of jobs immediately preceding the job being currently processed. The jobs in a given class need not be processed together. Based on a combinatorial analysis of the problem, an algorithm is developed to obtain an optimal schedule when the objective is to minimize mean flow time. The proposed algorithm is polynomially bounded in terms of the computational effort needed to solve the problem.
0 references
single facility scheduling
0 references
optimal schedule
0 references
minimize mean flow time
0 references
polynomially bounded
0 references
