Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication (Q880579): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10951-006-0325-5 / rank
Normal rank
 
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.1007/s10951-006-0325-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989570164 / 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: Measures of subproblem criticality in decomposition algorithms for shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Executing production schedules in the face of uncertainties: a review and some future directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guided Local Search with Shifting Bottleneck for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition methods for reentrant flow shops with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Experimental Data for Computational Testing with Machine Scheduling Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3951448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4238569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental evaluation of heuristic optimization algorithms: A tutorial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling batch processing machines with incompatible job families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance of decomposition procedures for job shop scheduling problems with bottleneck machines / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10951-006-0325-5 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:51, 10 December 2024

scientific article
Language Label Description Also known as
English
Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication
scientific article

    Statements

    Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication (English)
    0 references
    0 references
    0 references
    15 May 2007
    0 references
    Job shop scheduling
    0 references
    Maximum lateness
    0 references
    Shifting bottleneck
    0 references
    Computational evaluation
    0 references

    Identifiers