A note on a single-machine lot scheduling problem with indivisible orders (Q1652143): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:13, 1 February 2024
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
