Bounded parallel-batching scheduling with two competing agents (Q2434316): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Cheng, T. C. Edwin / rank
Normal rank
 
Property / author
 
Property / author: Shi-Sheng Li / rank
Normal rank
 
Property / author
 
Property / author: Cheng, T. C. Edwin / rank
 
Normal rank
Property / author
 
Property / author: Shi-Sheng Li / 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.1007/s10951-012-0274-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4236206281 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Problems with Two Competing Agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-agent single machine scheduling / 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: Batching identical jobs / 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: Minimizing total completion time on a batch processing machine with job families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-agent scheduling on a single machine with max-form criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / 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: Minimizing makespan on a single batch processing machine with dynamic job arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive Two-Agent Scheduling and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded parallel-batching scheduling with two competitive agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of bi-criteria scheduling on a single batch processing machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling problems with two competing agents to minimize minmax and minsum earliness measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine batch scheduling with two competing agents to minimize total flowtime / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the complexity of the problem of two-agent scheduling on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-agent scheduling to minimize the total cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with batching: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling two agents with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:32, 7 July 2024

scientific article
Language Label Description Also known as
English
Bounded parallel-batching scheduling with two competing agents
scientific article

    Statements

    Bounded parallel-batching scheduling with two competing agents (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 February 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    scheduling
    0 references
    competitive agents
    0 references
    parallel-batch
    0 references
    complexity
    0 references
    dynamic programming
    0 references
    0 references
    0 references
    0 references