Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. (Q1347602): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/jos.94 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067880102 / 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: Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimising makespan in the two-machine flow-shop with release times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Bounding Scheme for the Permutation Flow-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two branch and bound algorithms for the permutation flow shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive branching rule for the permutation flow-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for single machine sequencing with release dates to minimize total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank

Latest revision as of 00:19, 4 June 2024

scientific article
Language Label Description Also known as
English
Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times.
scientific article

    Statements

    Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 July 2003
    0 references
    0 references
    permutation flow shop
    0 references
    makespan
    0 references
    lateness
    0 references
    release times
    0 references
    0 references