A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem (Q1610145): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing with Earliness and Tardiness Penalties: A Review / 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: A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times / 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: A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Principle for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4695783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279269 / 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: Q3793928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4287985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4319220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5630824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach for crew pairing problems by column generation with an application to air transportation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on one-processor scheduling with asymmetric earliness and tardiness penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Bound of a Heuristic for the Common Due Date Scheduling Problem / 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: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Machine Scheduling by Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving binary cutting stock problems by column generation and branch- and-bound / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:03, 4 June 2024

scientific article
Language Label Description Also known as
English
A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
scientific article

    Statements

    A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem (English)
    0 references
    0 references
    0 references
    18 August 2002
    0 references
    0 references
    parallel machine scheduling
    0 references
    just-in-time
    0 references
    set partitioning
    0 references
    Dantzig-Wolfe decomposition
    0 references
    column generation
    0 references
    branch and bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references