Some results of the worst-case analysis for flow shop scheduling (Q1296692): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Algorithm for the <i>n</i> Job, <i>m</i> Machine Sequencing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Evaluation of Flow Shop Sequencing Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted neighborhood in the tabu search for the flowshop problem / 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: On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Functional Heuristic Algorithm for the Flowshop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic for the n-job, M-machine flow-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop sequencing with mean flowtime objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified simulated annealing algorithms for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic-Programming Solution of a Flowshop-Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Heuristics of Flow-Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: ANALYSIS FOR MINIMIZING WEIGHTED MEAN FLOW-TIME IN FLOW-SHOP SCHEDULING / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis of an approximation algorithm for flow-shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results in the worst-case analysis for flow-shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on worst-case analysis of approximation algorithms for a scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast tabu search algorithm for the permutation flow-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient heuristic approach to the scheduling of jobs in a flowshop / rank
 
Normal rank
Property / cites work
 
Property / cites work: A FLOWSHOP SCHEDULING ALGORITHM TO MINIMIZE TOTAL FLOWTIME / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for scheduling in flowshop with multiple objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for flowshop sequencing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3670909 / 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: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the heuristic solution of the permutation flow shop problem by path algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic method for the flow shop sequencing problem / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126550683 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(97)00139-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2002124279 / rank
 
Normal rank

Latest revision as of 10:33, 30 July 2024

scientific article
Language Label Description Also known as
English
Some results of the worst-case analysis for flow shop scheduling
scientific article

    Statements

    Some results of the worst-case analysis for flow shop scheduling (English)
    0 references
    0 references
    2 August 1999
    0 references
    scheduling
    0 references
    heuristics
    0 references
    worst-case analysis
    0 references
    flow-shop
    0 references
    0 references

    Identifiers