Scheduling the two-machine open shop problem under resource constraints for setting the jobs (Q2449360)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6293015
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling the two-machine open shop problem under resource constraints for setting the jobs |
scientific article; zbMATH DE number 6293015 |
Statements
Scheduling the two-machine open shop problem under resource constraints for setting the jobs (English)
0 references
8 May 2014
0 references
complexity
0 references
heuristics
0 references
lower bounds
0 references
makespan
0 references
open shop
0 references
scheduling
0 references
resource requirement
0 references
0 references
0 references
0 references
0 references
0.93344426
0 references
0.9203659
0 references
0.9149579
0 references
0.91328466
0 references
0.9117314
0 references
0.91001767
0 references
0.90606546
0 references
0.90548646
0 references
