Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound (Q1010284)
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 5539870
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound |
scientific article; zbMATH DE number 5539870 |
Statements
Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound (English)
0 references
3 April 2009
0 references
integrated decision problem
0 references
job-shop scheduling
0 references
employee scheduling
0 references
constraint programming
0 references
hybrid methods
0 references
0 references
0 references
0.880624532699585
0 references
0.8200376033782959
0 references
0.7782705426216125
0 references
0.7680476307868958
0 references
0.7595073580741882
0 references
