Scheduling of job-block with dead line in n\(\times 2\) flowshop problem with separated set up times (Q1060679)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling of job-block with dead line in n\(\times 2\) flowshop problem with separated set up times |
scientific article |
Statements
Scheduling of job-block with dead line in n\(\times 2\) flowshop problem with separated set up times (English)
0 references
1985
0 references
The problem to be considered is one of scheduling n jobs in a two-machine flow shop. Jobs are characterized by processing times and set-up times. Moreover, some subsets of jobs are to be processed in a no-wait mode before specified deadlines. The objective is to find a schedule of minimum length. In the paper an optimization algorithm is proposed, its complexity, however, is not evaluated.
0 references
deadline scheduling
0 references
two-machine flow shop
0 references
processing times
0 references
set-up times
0 references
schedule of minimum length
0 references
algorithm
0 references
