Lot-size scheduling of two types of jobs on identical machines (Q1917283): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Computational Complexity of the Capacitated Lot Size Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023677 / 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: Deterministic Production Planning: Algorithms and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Solution to the Dynamic, Multi-Item, Single-Machine Scheduling Problem / 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: Some Optimum Algorithms for Scheduling Problems with Changeover Costs / 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: Q3964308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4016680 / rank
 
Normal rank

Revision as of 13:08, 24 May 2024

scientific article
Language Label Description Also known as
English
Lot-size scheduling of two types of jobs on identical machines
scientific article

    Statements