Job selection in a heavily loaded shop (Q1373892): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Selecting jobs for heavily loaded shop with lateness penalties / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Order acceptance strategies in a production-to-order environment with setup times and due-dates / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Job selection and sequencing on a single machine in a random environment / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3885184 / rank | |||
Normal rank | |||
Latest revision as of 19:20, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Job selection in a heavily loaded shop |
scientific article |
Statements
Job selection in a heavily loaded shop (English)
0 references
1997
0 references
job selection
0 references
heavily loaded shop
0 references
branch-and-bound
0 references
NP-hard
0 references
pseudo-polynomial time algorithms
0 references
0 references
