A polynomial algorithm for lot-size scheduling of two type tasks. (Q1853075): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(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: A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch scheduling with deadlines on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: High Multiplicity in Earliness-Tardiness Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with high multiplicity / 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: Minimizing the number of tardy job units under release time constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Optimum Algorithms for Scheduling Problems with Changeover Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform machine scheduling of unit-time jobs subject to resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Production Scheduling of Multicommodity in Flow Line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot-size scheduling of two types of jobs on identical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with batching: A review / 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: A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic lotsizing models for production planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for a one machine batching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on “Parallel Machine Scheduling with Batch Setup Times” / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(01)00331-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1980522496 / rank
 
Normal rank

Latest revision as of 11:00, 30 July 2024

scientific article
Language Label Description Also known as
English
A polynomial algorithm for lot-size scheduling of two type tasks.
scientific article

    Statements

    A polynomial algorithm for lot-size scheduling of two type tasks. (English)
    0 references
    0 references
    0 references
    0 references
    21 January 2003
    0 references
    Algorithms
    0 references
    Lot-size scheduling
    0 references
    Parallel machines
    0 references
    0 references
    0 references

    Identifiers