Scheduling a bounded parallel-batching machine with incompatible job families and rejection (Q489155): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an 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/s40305-014-0062-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2112736884 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiprocessor Scheduling with Rejection / 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: A PTAS for parallel batch scheduling with rejection and dynamic job arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling linear deteriorating jobs with rejection on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms in batch processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Batch Loading and Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with machine cost and rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Techniques for scheduling with rejection / 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: Preemptive scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan on a single batch processing machine with dynamic job arrivals / 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: Parallel-machine scheduling with deteriorating jobs and rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded single-machine parallel-batch scheduling with release dates and rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling one batch processor subject to job release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Parallel-Batch Scheduling on Unrelated Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on offline scheduling with rejection / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:55, 9 July 2024

scientific article
Language Label Description Also known as
English
Scheduling a bounded parallel-batching machine with incompatible job families and rejection
scientific article

    Statements

    Scheduling a bounded parallel-batching machine with incompatible job families and rejection (English)
    0 references
    0 references
    0 references
    27 January 2015
    0 references
    parallel-batching scheduling
    0 references
    incompatible job families
    0 references
    rejection
    0 references
    approximation algorithm
    0 references
    0 references

    Identifiers