A DP algorithm for minimizing makespan and total completion time on a series-batching machine (Q987835): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q176697
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Yanpei Liu / 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.1016/j.ipl.2009.02.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005936117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of one-machine batching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multiple-criterion model for machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2734595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batching machine / 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: Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3070927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time / rank
 
Normal rank

Revision as of 01:53, 3 July 2024

scientific article
Language Label Description Also known as
English
A DP algorithm for minimizing makespan and total completion time on a series-batching machine
scientific article

    Statements

    A DP algorithm for minimizing makespan and total completion time on a series-batching machine (English)
    0 references
    0 references
    0 references
    0 references
    16 August 2010
    0 references
    multicriteria scheduling
    0 references
    series-batching machine
    0 references
    makespan
    0 references
    total completion time
    0 references
    Pareto optimal solutions
    0 references
    computational complexity
    0 references

    Identifiers