Two-machine shop scheduling problems with batch processing (Q1802481): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0895-7177(93)90196-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1997499543 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Batching to Minimize Flow Times on One Machine / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Complexity of Scheduling with Batch Setup Times / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: One-pass batching algorithms for the one-machine problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank | |||
Normal rank | |||
Latest revision as of 16:16, 17 May 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
