Scheduling larger job shops: a decomposition approach (Q4230201): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/00207549608905010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2062905994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Solving the Job-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Solving Production-Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3791008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job-Shop Scheduling by Implicit Enumeration / rank
 
Normal rank

Latest revision as of 18:47, 28 May 2024

scientific article; zbMATH DE number 1256523
Language Label Description Also known as
English
Scheduling larger job shops: a decomposition approach
scientific article; zbMATH DE number 1256523

    Statements

    Scheduling larger job shops: a decomposition approach (English)
    0 references
    0 references
    0 references
    1996
    0 references
    0 references
    large scale job scheduling
    0 references
    cell scheduling
    0 references
    job shop scheduling
    0 references
    0 references