The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability (Q1577995): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Remarks on: “Some Extensions of the Discrete Lotsizing and Scheduling Problem” / 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: Analysis of relaxations for the multi-item capacitated lot-sizing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated Annealing – An Annotated Bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batching to Minimize Flow Times on One Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete lot-sizing and scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete lot-sizing and scheduling problem with sequence-dependent setup costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Strong '' NP-Completeness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Change-Over Scheduling of Several Products on One Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Multi-Item Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equation of State Calculations by Fast Computing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic lotsizing models for production planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Extensions of the Discrete Lotsizing and Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batching in single operation manufacturing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3964308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3809582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job Shop Scheduling by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Groups of Jobs on a Single Machine / rank
 
Normal rank

Latest revision as of 12:24, 30 May 2024

scientific article
Language Label Description Also known as
English
The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability
scientific article

    Statements

    The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability (English)
    0 references
    0 references
    0 references
    19 September 2000
    0 references
    manufacturing
    0 references
    complexity
    0 references
    discrete lot-sizing and scheduling problem
    0 references
    batch availability
    0 references
    mixed-integer linear program
    0 references
    simulated-annealing
    0 references
    0 references
    0 references
    0 references

    Identifiers

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