Scheduling unit time open shops to minimize the weighted number of late jobs (Q1318657): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open shop problems with unit time operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note On The Complexity Of Openshop Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0167-6377(93)90088-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978964060 / rank
 
Normal rank

Latest revision as of 09:09, 30 July 2024

scientific article
Language Label Description Also known as
English
Scheduling unit time open shops to minimize the weighted number of late jobs
scientific article

    Statements

    Scheduling unit time open shops to minimize the weighted number of late jobs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 April 1994
    0 references
    unit processing times
    0 references
    polynomial algorithm
    0 references
    open shop
    0 references
    fixed number of machines
    0 references
    weighted number of late jobs
    0 references

    Identifiers