A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes (Q976033): 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.2009.12.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978018515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a single batch processing machine with non-identical job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Batch Loading and Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batch processing machine with non-identical job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan on a single batch processing machine with nonidentical job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan on a single batching machine with release times and non-identical job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Price: Column Generation for Solving Huge Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving binary cutting stock problems by column generation and branch- and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Column Generation Approach for Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Price Algorithm for the Generalized Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Parallel Machine Scheduling Problems by Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Indexed Formulations for Machine Scheduling Problems: Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Principle for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Set-Covering-Based Heuristic Approach for Bin-Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational study of a column generation algorithm for bin packing and cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for IP column generation / rank
 
Normal rank

Latest revision as of 22:41, 2 July 2024

scientific article
Language Label Description Also known as
English
A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
scientific article

    Statements

    A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes (English)
    0 references
    0 references
    11 June 2010
    0 references
    0 references
    scheduling
    0 references
    batch processing machine
    0 references
    makespan
    0 references
    column generation
    0 references
    branch and price
    0 references
    0 references
    0 references
    0 references