A taxonomy of flexible flow line scheduling procedures (Q859681): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of flexible flow lines in an automobile assembly plant / rank
 
Normal rank
Property / cites work
 
Property / cites work: A flexible flowshop problem with total flow time minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2735585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and bound algorithm for the flow shop with multiple processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for scheduling in a flow shop with multiple processors / 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: 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 Exact Method for Solving the Multi-Processor Flow-Shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SHIFTING BOTTLENECK APPROACH FOR A PARALLEL-MACHINE FLOWSHOP SCHEDULING PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive hybrid flowshop scheduling problem of interval orders / 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: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for hybrid flow shops with controllable processing times and assignable due dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for the job-shop scheduling problem with multi-purpose machines / 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: A review of exact solution methods for the non-preemptive multiprocessor flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4487091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling flexible flow lines with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan in hybrid flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4935970 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4546261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search algorithms for the multiprocessor flow shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The flow shop with parallel machines: A tabu search approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metaheuristics: A bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and bound crossed with GA to solve hybrid flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conceptual framework for lot-sizing and scheduling of flexible flow lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-stage parallel-processor flowshop problem with minimum flowtime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling flexible flow lines with no in-process buffers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous versus sequential loading and scheduling of flexible assembly systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4810039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling algorithms for flexible flowshops: Worst and average case performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adaptable Scheduling Algorithm for Flexible Flow Lines / rank
 
Normal rank

Latest revision as of 12:40, 25 June 2024

scientific article
Language Label Description Also known as
English
A taxonomy of flexible flow line scheduling procedures
scientific article

    Statements

    A taxonomy of flexible flow line scheduling procedures (English)
    0 references
    0 references
    0 references
    16 January 2007
    0 references
    0 references
    flexible flow line
    0 references
    scheduling
    0 references
    batching
    0 references
    literature review
    0 references
    taxonomy
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references