Two-machine shop scheduling problems with batch processing (Q1802481): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q224835 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Jacek Błażewicz / rank | |||
Normal rank | |||
Revision as of 07:12, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two-machine shop scheduling problems with batch processing |
scientific article |
Statements
Two-machine shop scheduling problems with batch processing (English)
0 references
21 July 1993
0 references
The considered problem is concerned with two machine shop scheduling problems. Jobs are divided into groups and set up times are to be added whenever two jobs of different groups are processed consecutively on the same machine. The problems of minimizing makespan for the flow and open shop are proved to be NP-hard.
0 references
flow shop
0 references
batch processing complexity
0 references
two machine shop scheduling
0 references
makespan
0 references
NP-hard
0 references
