Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families (Q1734827): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q128288129, #quickstatements; #temporary_batch_1723473115199
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2019.02.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2920140993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs on a single batch processing machine with incompatible job families and weighted number of tardy jobs objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic scheduling of jobs on a multi-product batch processing machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch scheduling to minimize maximum lateness / 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 parallel batch processing machines with arbitrary job sizes and incompatible job families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a single batch processing machine with non-identical job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling batch processing machines with incompatible job families / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128288129 / rank
 
Normal rank

Latest revision as of 16:35, 12 August 2024

scientific article
Language Label Description Also known as
English
Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families
scientific article

    Statements

    Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families (English)
    0 references
    0 references
    0 references
    0 references
    27 March 2019
    0 references
    batch processing machine
    0 references
    heuristics
    0 references
    maximum lateness
    0 references
    lower bound
    0 references
    job families
    0 references

    Identifiers