A permutation flow-shop scheduling problem with convex models of operation processing times (Q1593519)
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 1554220
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A permutation flow-shop scheduling problem with convex models of operation processing times |
scientific article; zbMATH DE number 1554220 |
Statements
A permutation flow-shop scheduling problem with convex models of operation processing times (English)
0 references
17 January 2001
0 references
flow-shop scheduling problem
0 references
processing order of the jobs
0 references
allocation of a constrained resource
0 references
computational complexity analysis
0 references
0.8774065971374512
0 references
0.8651775121688843
0 references
0.86141037940979
0 references
0.8478549718856812
0 references
0.8478549122810364
0 references
