A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application (Q2571194): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2004.09.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2007547395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correctness of query execution strategies in distributed databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job lateness in a two-machine flowshop with setup times separated / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4441490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal scheduling of the 3-machine assembly-type flow shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the two-stage assembly scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops / 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: Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling alternative operations in two-machine flow-shops / 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: Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling / 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: Minimizing Makespan in a Class of Reentrant Shops / rank
 
Normal rank

Latest revision as of 10:02, 11 June 2024

scientific article
Language Label Description Also known as
English
A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application
scientific article

    Statements

    A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application (English)
    0 references
    0 references
    0 references
    1 November 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    assembly flowshop
    0 references
    distributed database system
    0 references
    scheduling
    0 references
    maximum lateness
    0 references
    particle swarm optimization
    0 references
    tabu search
    0 references
    heuristic
    0 references
    0 references