A permutation flow-shop scheduling problem with convex models of operation processing times (Q1593519): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Cheng, T. C. Edwin / rank | |||
| Property / author | |||
| Property / author: Adam Janiak / rank | |||
| Property / author | |||
| Property / author: Cheng, T. C. Edwin / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Adam Janiak / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1018943300630 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2115190719 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:47, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A permutation flow-shop scheduling problem with convex models of operation processing times |
scientific article |
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
