A tabu-search heuristic for the flexible-resource flow shop scheduling problem (Q2367002): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparative Study of Flow-Shop Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search experience in production scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-objective approach to resource allocation in single machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy / 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: A new integer programming formulation for the permutation flowshop 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: A user's guide to tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource-constrained multi-project scheduling with tardy costs: Comparing myopic, bottleneck, and resource pricing heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiobjective network scheduling with efficient use of renewable and nonrenewable resources / 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: Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriterion approach to time/cost trade-offs in sequencing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H] / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02023075 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1983457098 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:51, 30 July 2024

scientific article
Language Label Description Also known as
English
A tabu-search heuristic for the flexible-resource flow shop scheduling problem
scientific article

    Statements

    A tabu-search heuristic for the flexible-resource flow shop scheduling problem (English)
    0 references
    0 references
    0 references
    16 August 1993
    0 references
    tabu search heuristic
    0 references
    flexible-resource flow shop scheduling
    0 references

    Identifiers