Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm (Q2284476): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.apm.2016.09.022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2529659779 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56611819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525910 / 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: Job-shop scheduling with multi-purpose machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3535947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flexible job shop scheduling with overlapping in operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical models for job-shop scheduling problems with routing and process plan flexibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing and scheduling in a flexible job shop by tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective neighbourhood functions for the flexible job shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable neighbourhood search algorithm for the flexible job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for the two-machine open-shop scheduling problem with transportation times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search algorithms for job-shop problems with a single transport robot / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling in the presence of transportation times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing a sustainable closed-loop supply chain network based on triple bottom line approach: a comparison of metaheuristics hybridization techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective architecture for learning and evolving flexible job-shop schedules / rank
 
Normal rank

Latest revision as of 10:29, 21 July 2024

scientific article
Language Label Description Also known as
English
Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm
scientific article

    Statements

    Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm (English)
    0 references
    0 references
    15 January 2020
    0 references
    scheduling
    0 references
    flexible job shops
    0 references
    transportation times
    0 references
    mathematical models
    0 references
    hybrid imperialist competitive algorithm
    0 references

    Identifiers