Scheduling job families on non-identical parallel machines with time constraints (Q744650): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1007/s10479-012-1107-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2060691397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs on parallel machines to minimize a regular step total cost function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mean Flow Time Minimization in Reentrant Job Shops with a Hub / rank
 
Normal rank
Property / cites work
 
Property / cites work: Re-entrant lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with advanced process control constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of scheduling job families about a common due date / rank
 
Normal rank

Latest revision as of 02:44, 9 July 2024

scientific article
Language Label Description Also known as
English
Scheduling job families on non-identical parallel machines with time constraints
scientific article

    Statements

    Scheduling job families on non-identical parallel machines with time constraints (English)
    0 references
    0 references
    0 references
    26 September 2014
    0 references
    scheduling
    0 references
    parallel machines
    0 references
    time constraint
    0 references
    mixed integer linear programming
    0 references
    heuristics
    0 references
    semiconductor manufacturing
    0 references

    Identifiers