A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines (Q1025264): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1268135
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2009.02.004 / rank
Normal rank
 
Property / author
 
Property / author: Chuen-Lung S. Chen / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BPSS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2009.02.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988854296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adaptable Scheduling Algorithm for Flexible Flow Lines / 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: Scheduling of flexible flow lines in an automobile assembly plant / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dispatching rule-based approach to production scheduling in a printed circuit board manufacturing system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck-focused scheduling for a hybrid flowshop / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs on a \(k\)-stage flexible flow-shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review and classification of heuristics for permutation flow-shop scheduling with makespan objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of sequencing rules in static and dynamic hybrid flow systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of Scheduling Rules in a Flow Shop with Multiple Processors: A Simulation / 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: A Functional Heuristic Algorithm for the Flowshop Scheduling 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: A survey and evaluation of static flowshop scheduling heuristics / 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: A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation / 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: Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard / 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 flowshop scheduling problem with two operations per job / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2009.02.004 / rank
 
Normal rank

Latest revision as of 13:33, 10 December 2024

scientific article
Language Label Description Also known as
English
A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines
scientific article

    Statements

    A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines (English)
    0 references
    0 references
    0 references
    18 June 2009
    0 references
    bottleneck-based multiple insertion heuristic
    0 references
    flexible flow line
    0 references
    bottleneck
    0 references
    unrelated parallel machines
    0 references
    makespan
    0 references
    0 references

    Identifiers