A note on a single-machine lot scheduling problem with indivisible orders (Q1652143)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on a single-machine lot scheduling problem with indivisible orders |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on a single-machine lot scheduling problem with indivisible orders |
scientific article |
Statements
A note on a single-machine lot scheduling problem with indivisible orders (English)
0 references
11 July 2018
0 references
lot scheduling
0 references
single machine
0 references
total completion time
0 references
indivisible order
0 references
integer programming
0 references
