Bounded serial-batching scheduling for minimizing maximum lateness and makespan (Q1751110): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2015.02.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003983870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Groups of Jobs on a Single 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: Q3070927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Algorithm for a Bicriteria Batching Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A DP algorithm for minimizing makespan and total completion time on a series-batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2734595 / rank
 
Normal rank

Latest revision as of 16:05, 15 July 2024

scientific article
Language Label Description Also known as
English
Bounded serial-batching scheduling for minimizing maximum lateness and makespan
scientific article

    Statements

    Bounded serial-batching scheduling for minimizing maximum lateness and makespan (English)
    0 references
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    bicriteria scheduling
    0 references
    serial-batching machine
    0 references
    bounded
    0 references
    makespan
    0 references
    maximum lateness
    0 references
    Pareto optimal solutions
    0 references

    Identifiers