Two-stage hybrid flow shop scheduling with dynamic job arrivals (Q1762160): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2011.10.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1996628037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batching and Scheduling Jobs on Batch and Discrete Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed / 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: The hybrid flow shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan on a single batch processing machine with dynamic job arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: The use of upstream and downstream information in scheduling semiconductor batch operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling batch processing machines with incompatible job families / rank
 
Normal rank
Property / cites work
 
Property / cites work: A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed integer formulation to minimize makespan in a flow shop with batch processing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan minimization in a no-wait flow shop problem with two batching machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch scheduling in the no-wait two-machine flowshop to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Groups of Jobs on a Single Machine / rank
 
Normal rank

Latest revision as of 21:09, 5 July 2024

scientific article
Language Label Description Also known as
English
Two-stage hybrid flow shop scheduling with dynamic job arrivals
scientific article

    Statements

    Two-stage hybrid flow shop scheduling with dynamic job arrivals (English)
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    batch scheduling
    0 references
    dynamic programming
    0 references
    heuristics
    0 references

    Identifiers

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