On the number of feasible schedules of the open-shop-problem-an application of special latin rectangles (Q4327891): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/02331939208843762 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999049120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4769064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Asymptotic Number of Latin Rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine shop scheduling problems with batch processing / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:27, 23 May 2024

scientific article; zbMATH DE number 737306
Language Label Description Also known as
English
On the number of feasible schedules of the open-shop-problem-an application of special latin rectangles
scientific article; zbMATH DE number 737306

    Statements

    On the number of feasible schedules of the open-shop-problem-an application of special latin rectangles (English)
    0 references
    0 references
    0 references
    0 references
    27 March 1995
    0 references
    0 references
    Latin rectangles
    0 references
    open-shop problem
    0 references
    0 references