A heuristic MBLS algorithm for the two semi-online parallel machine scheduling problems with deterioration jobs (Q5456312): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Complexity analysis of job-shop scheduling with deteriorating jobs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Semi on-line scheduling on two identical machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Semi-on-line scheduling problems for maximizing the minimum machine completion time / rank | |||
Normal rank | |||
Revision as of 19:56, 27 June 2024
scientific article; zbMATH DE number 5260885
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic MBLS algorithm for the two semi-online parallel machine scheduling problems with deterioration jobs |
scientific article; zbMATH DE number 5260885 |
Statements
A heuristic MBLS algorithm for the two semi-online parallel machine scheduling problems with deterioration jobs (English)
0 references
4 April 2008
0 references
scheduling
0 references
deterioration job
0 references
