A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects (Q497951): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6485503 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
scheduling | |||
| Property / zbMATH Keywords: scheduling / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
single-machine | |||
| Property / zbMATH Keywords: single-machine / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
tardiness | |||
| Property / zbMATH Keywords: tardiness / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
learning effect | |||
| Property / zbMATH Keywords: learning effect / rank | |||
Normal rank | |||
Revision as of 23:32, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects |
scientific article |
Statements
A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects (English)
0 references
25 September 2015
0 references
scheduling
0 references
single-machine
0 references
tardiness
0 references
learning effect
0 references
