A filter-and-fan approach to the job shop scheduling problem (Q958547): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: JOBSHOP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Scatter Search / 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.ejor.2007.12.035 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2058578326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job Shop Scheduling by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of the Job-Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guided Local Search with Shifting Bottleneck for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph ejection chains and tabu search for the crew scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple filter-and-fan approach to the facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Taboo Search Algorithm for the Job Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxed tours and path ejections for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subpath Ejection Method for the Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job shop scheduling with beam search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job Shop Scheduling by Local Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ejection Chain Approach for the Generalized Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid genetic algorithm for the job shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning and Scheduling in Manufacturing and Services / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Solving the Job-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of constraint satisfaction for multiple capacitated job shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending the shifting bottleneck procedure to real-life applications / rank
 
Normal rank

Latest revision as of 21:06, 28 June 2024

scientific article
Language Label Description Also known as
English
A filter-and-fan approach to the job shop scheduling problem
scientific article

    Statements

    A filter-and-fan approach to the job shop scheduling problem (English)
    0 references
    0 references
    0 references
    5 December 2008
    0 references
    heuristics
    0 references
    local search
    0 references
    job shop problem
    0 references
    0 references
    0 references
    0 references

    Identifiers