A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size (Q1596947): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Algorithm for the <i>n</i> Job, <i>m</i> Machine Sequencing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Evaluation of Flow Shop Sequencing Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the Efficiency of Tabu Search for Machine Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some efficient heuristic methods for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3778531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the heuristic solution of the permutation flow shop problem by path algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic method for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lessons of Flowshop Scheduling Research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Groups of Jobs on a Single Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of one-machine batching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-pass batching algorithms for the one-machine problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batching in single operation manufacturing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for permutation flow shop scheduling with batch setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3479795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Insertion techniques for the heuristic solution of the job shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive heuristic algorithms for the open shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Single Machine Early/Tardy Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the application of insertion techniques for job shop problems with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of priority rule-based scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Scheduling Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some relations between neighbourhood graphs for a permutation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785827 / 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: Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of local search methods for flow shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3981972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job-shop scheduling: Computational study of local search and large-step optimization methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving local search heuristics for some scheduling problems. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving local search heuristics for some scheduling problems. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: How easy is local search? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine shop scheduling problems with batch processing / rank
 
Normal rank

Latest revision as of 00:28, 4 June 2024

scientific article
Language Label Description Also known as
English
A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
scientific article

    Statements

    A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size (English)
    0 references
    0 references
    0 references
    0 references
    5 May 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    insertion algorithms
    0 references
    local search
    0 references
    multilevel heurstics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references