An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times (Q1761212): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2012.01.011 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2012.01.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2002122925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Average number of pivot steps required by the Simplex-Method is polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random knapsack in expected polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hard dial-a-ride problem that is easy on average / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops / 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: Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. / 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: Minimizing maximum lateness in a flow shop subject to release dates / 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: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effectiveness of the longest delivery time rule for the flow shop delivery time problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Probabilistic Analysis of Two-Machine Flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: An empirical analysis of the optimality rate of flow shop heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simple scheduling algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some efficient heuristic methods for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing heuristics: We have it all wrong / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4460278 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2012.01.011 / rank
 
Normal rank

Latest revision as of 09:02, 11 December 2024

scientific article
Language Label Description Also known as
English
An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times
scientific article

    Statements

    An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times (English)
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    scheduling
    0 references
    sequencing
    0 references
    heuristic
    0 references
    simulation
    0 references
    optimality
    0 references
    optimality rate
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers