The job shop tardiness problem: A decomposition approach (Q1310711): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Narayan Raman / rank
Normal rank
 
Property / author
 
Property / author: Narayan Raman / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Focused Scheduling in Proportionate Flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-time scheduling of an automated manufacturing center / rank
 
Normal rank
Property / cites work
 
Property / cites work: On general routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid algorithm for the one machine sequencing problem to minimize total tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(93)90163-h / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2154716183 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:14, 30 July 2024

scientific article
Language Label Description Also known as
English
The job shop tardiness problem: A decomposition approach
scientific article

    Statements

    The job shop tardiness problem: A decomposition approach (English)
    0 references
    0 references
    0 references
    21 March 1994
    0 references
    0 references
    job shop tardiness problem
    0 references
    effectiveness
    0 references
    manufacturing
    0 references
    due dates
    0 references
    prioritizing dispatching rules
    0 references
    heuristic
    0 references
    0 references