A new approach to computing optimal schedules for the job-shop scheduling problem (Q4645937)
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 new approach to computing optimal schedules for the job-shop scheduling problem |
scientific article; zbMATH DE number 7000363
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new approach to computing optimal schedules for the job-shop scheduling problem |
scientific article; zbMATH DE number 7000363 |
Statements
A new approach to computing optimal schedules for the job-shop scheduling problem (English)
0 references
11 January 2019
0 references
optimal schedule
0 references
feasibility problem
0 references
feasible schedule
0 references
fractional packing
0 references
processing window
0 references
0 references
0.9202525
0 references
0.91379595
0 references
0 references
0.9077612
0 references
0.90626013
0 references
0 references
0.8988761
0 references
