Polynomial time algorithms for the UET permutation flowshop problem with time delays (Q2384903): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3525910 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Flowshop and Jobshop Schedules: Complexity and Approximation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sequencing <i>n</i> Jobs on Two Machines with Arbitrary Time Lags / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Permutation flowshop scheduling problems with maximal and minimal time lags / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4884350 / rank | |||
Normal rank |
Latest revision as of 09:49, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Polynomial time algorithms for the UET permutation flowshop problem with time delays |
scientific article |
Statements
Polynomial time algorithms for the UET permutation flowshop problem with time delays (English)
0 references
10 October 2007
0 references
Complexity
0 references
makespan
0 references
permutation flowshop
0 references
scheduling
0 references
time delays
0 references
0 references