Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption (Q1652150): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process / rank
 
Normal rank
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: A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing of robot activities and parts in two-machine robotic cells / rank
 
Normal rank
Property / cites work
 
Property / cites work: Throughput optimization in two-machine flowshops with flexible operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical models for preemptive shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing in an Assembly Line with Blocking to Minimize Cycle Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A three-phase algorithm for flowshop scheduling with blocking to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal planning of part's machining on a number of machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounding schemes for flowshops with blocking in-process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing blocking flow shop scheduling problem with total completion time criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling alternative operations in two-machine flow-shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow-shop scheduling with flexible processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on scheduling alternative operations in two-machine flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling three-operation jobs in a two-machine flow shop to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop scheduling with flexible operations and controllable processing times / 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: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4197160 / rank
 
Normal rank

Latest revision as of 02:07, 16 July 2024

scientific article
Language Label Description Also known as
English
Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption
scientific article

    Statements

    Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption (English)
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    blocking flow shop scheduling
    0 references
    multi-task flexibility
    0 references
    preemption
    0 references
    makespan
    0 references
    variable neighborhood search
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references