Developing feasible and optimal schedules of jobs on one machine (Q380659): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68M20 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6226967 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
optimal schedule | |||
| Property / zbMATH Keywords: optimal schedule / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
job sequencing | |||
| Property / zbMATH Keywords: job sequencing / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
makespan constraints | |||
| Property / zbMATH Keywords: makespan constraints / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
sequential optimization algorithms | |||
| Property / zbMATH Keywords: sequential optimization algorithms / rank | |||
Normal rank | |||
Revision as of 11:41, 29 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Developing feasible and optimal schedules of jobs on one machine |
scientific article |
Statements
Developing feasible and optimal schedules of jobs on one machine (English)
0 references
14 November 2013
0 references
optimal schedule
0 references
job sequencing
0 references
makespan constraints
0 references
sequential optimization algorithms
0 references
