Minimizing the total completion time in a distributed two stage assembly system with setup times (Q337027): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1016/j.cor.2014.02.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2083233352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Stage Assembly Scheduling Problem: Complexity and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application / rank
 
Normal rank
Property / cites work
 
Property / cites work: The three-stage assembly flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distributed permutation flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved genetic algorithm for the distributed and flexible job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-stage assembly scheduling problem to minimize total completion time with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5437765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing: A tool for operational research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable neighborhood decomposition search method for supply chain management planning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5485130 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:46, 12 July 2024

scientific article
Language Label Description Also known as
English
Minimizing the total completion time in a distributed two stage assembly system with setup times
scientific article

    Statements

    Minimizing the total completion time in a distributed two stage assembly system with setup times (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    scheduling
    0 references
    distributed two-stage assembly flowshop
    0 references
    hybrid meta-heuristics
    0 references
    total completion time
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers