Maximizing the weighted number of just-in-time jobs in flow shop scheduling (Q835569): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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/s10951-007-0030-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1967455912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the weighted number of tardy jobs on a two-machine flow shop. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph / 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: Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling shops to minimize the weighted number of late jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling to minimize the number of early and tardy jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the weighted number of tardy jobs on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the weighted number of tardy jobs on parallel processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithms to minimize the weighted number of late jobs on a single machine. / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:52, 1 July 2024

scientific article
Language Label Description Also known as
English
Maximizing the weighted number of just-in-time jobs in flow shop scheduling
scientific article

    Statements

    Maximizing the weighted number of just-in-time jobs in flow shop scheduling (English)
    0 references
    0 references
    0 references
    28 August 2009
    0 references
    0 references
    scheduling
    0 references
    just-in-time jobs
    0 references
    NP-complete
    0 references
    0 references