A study on open shop scheduling to minimise total tardiness (Q2967576): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1080/00207543.2010.497174 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2028651280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable neighbourhood search algorithm for the flexible job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch \(\&\) bound algorithm for the open-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Solving Production-Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound for the open-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling flexible flow lines with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for flexible job shop scheduling with fuzzy processing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling preemptive open shops to minimize total tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A contribution and new heuristics for open shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of integer programming formulations for scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved genetic algorithm for the flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new particle swarm optimization for the open shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparative evaluation of MILP flowshop models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New MILP models for the permutation flowshop problem / rank
 
Normal rank

Latest revision as of 12:38, 13 July 2024

scientific article
Language Label Description Also known as
English
A study on open shop scheduling to minimise total tardiness
scientific article

    Statements

    A study on open shop scheduling to minimise total tardiness (English)
    0 references
    0 references
    0 references
    0 references
    1 March 2017
    0 references
    scheduling
    0 references
    open shop
    0 references
    mathematical model
    0 references
    mixed integer linear programming
    0 references
    genetic algorithm
    0 references
    variable neighbourhood serach
    0 references
    Taguchi method
    0 references
    total tardiness
    0 references

    Identifiers