A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem (Q1364482): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Timkovsky, Vadim G. / rank | |||
Property / author | |||
Property / author: Timkovsky, Vadim G. / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimizing maximum lateness in a two-machine unit-time job shop / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3942735 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4131987 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An efficient algorithm for a job shop problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Total completion time minimization in two-machine job shops with unit-time operations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computational Complexity of Discrete Optimization Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On general routing problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3737196 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3713852 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2040466446 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:20, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem |
scientific article |
Statements
A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem (English)
0 references
4 September 1997
0 references
scheduling problem
0 references
pseudopolynomial-time algorithms
0 references
0 references