Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem (Q2273694): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Tabu search for a class of single-machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast heuristics for minimizing the makespan in non-permutation flow shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flow shop scheduling problem with an outsourcing option / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ordered Flow Shop with Two Agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outsourcing and scheduling for two-machine ordered flow shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved NEH-based heuristic for the permutation flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the state-of-the-art of common due date assignment and scheduling research / rank
 
Normal rank
Property / cites work
 
Property / cites work: The three-machine proportionate flow shop problem with unequal machine speeds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved NEH heuristic to minimize makespan in permutation flow shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of the permutation flow shop problem based on a tight lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling of ordered flow shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: V-Shaped Policies for Scheduling Deteriorating Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Review of the ordered and proportionate flow shop scheduling research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3212909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convex property of an ordered flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow Shop Scheduling Problems with No In-Process Waiting: A Special Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered Flow Shop Problems with no In-Process Waiting: Further Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Three-Machine No-Wait Flow Shop is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comprehensive review and evaluation of permutation flowshop heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal streaming of a single job in a two-stage flow shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop Sequencing Problem with Ordered Processing Time Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop sequencing problem with ordered processing time matrices: A general case / 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: Q5191184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New hard benchmark for flowshop scheduling problems minimising makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3820362 / rank
 
Normal rank

Revision as of 12:28, 20 July 2024

scientific article
Language Label Description Also known as
English
Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem
scientific article

    Statements

    Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem (English)
    0 references
    0 references
    25 September 2019
    0 references
    ordered flow shop scheduling
    0 references
    pyramidal-shaped property
    0 references
    V-shaped property
    0 references
    makespan minimization
    0 references
    iterated local search
    0 references
    heuristics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers