Some local search algorithms for no-wait flow-shop problem with makespan criterion (Q2387266): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1056670
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Jozef Grabowski / 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.2004.02.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979763505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the Flowshop-Scheduling Problem with No Intermediate Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing of jobs in some production system / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Flow-Shop Sequencing Problem with No Wait in Process<sup>†</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solutions to the Constrained Flowshop Sequencing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Machine No-Wait Flow Shop Scheduling with Missing Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: New heuristics for no-wait flowshops to minimize makespan. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximative procedures for no-wait job shop scheduling. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New block properties for the permutation flow shop problem with application in tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordonnancements à contraintes disjonctives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Numerical Experiments for an <i>M</i> × <i>J</i> Flow Shop and its Decision-Theoretical Aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for flowshop sequencing / rank
 
Normal rank

Revision as of 14:56, 10 June 2024

scientific article
Language Label Description Also known as
English
Some local search algorithms for no-wait flow-shop problem with makespan criterion
scientific article

    Statements

    Some local search algorithms for no-wait flow-shop problem with makespan criterion (English)
    0 references
    0 references
    0 references
    2 September 2005
    0 references
    Flow-shop scheduling
    0 references
    No-wait
    0 references
    Makespan
    0 references
    Local search
    0 references
    Tabu search
    0 references
    Empirical evaluation
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers