A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem (Q915632): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3470246 / 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: 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: Computational Complexity of Discrete Optimization Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity of Scheduling Shops with No Wait in Process / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some no-wait shops scheduling problems: Complexity aspect / rank | |||
Normal rank |
Latest revision as of 09:33, 21 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem |
scientific article |
Statements
A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem (English)
0 references
1989
0 references
job shop
0 references
unit processing times
0 references
two machines
0 references
pseudo-polynomial algorithms
0 references
0 references