Single-machine batch scheduling with job processing time compatibility (Q2342681): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Scheduling an unbounded batching machine with job processing time compatibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling hybrid flowshop with parallel batching machines and compatibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batch processing machine with bipartite compatibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5431779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for single-machine problems with positive finish-start time-lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch machine production with perishability time windows and limited batch size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine parallel batch scheduling subject to precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Batch Loading and Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch processing with interval graph compatibilities between tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing number of tardy jobs on a batch processing machine with 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: Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan / 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: Flowshop scheduling problem with a batching machine and task compatibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling batches with simultaneous job processing for two-machine shop problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Independent Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan / rank
 
Normal rank

Latest revision as of 01:18, 10 July 2024

scientific article
Language Label Description Also known as
English
Single-machine batch scheduling with job processing time compatibility
scientific article

    Statements

    Single-machine batch scheduling with job processing time compatibility (English)
    0 references
    0 references
    29 April 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    batch machine
    0 references
    compatibility
    0 references
    release date
    0 references
    approximation algorithm
    0 references
    0 references
    0 references
    0 references