Dynamic scheduling of batch-processing machines with non-identical product sizes (Q5438667): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1080/00207540600690537 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2106907816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batch processing machine with non-identical job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Managing batch processors to reduce lead time in a semiconductor packaging line / 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: Optimal control of batch service queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Batch Loading and Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic scheduling of a batch processing machine with incompatible job families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient scheduling algorithms for a single batch processing machine / 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: Worst-case analysis of greedy algorithms for the subset-sum problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Class of Bulk Queues with Poisson Input / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with batching: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: The use of upstream and downstream information in scheduling semiconductor batch operations / 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 / cites work
 
Property / cites work: Adaptive scheduling of batch servers in flow shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic scheduling of batch servers with compatible product families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic job assignment heuristics for multi-server batch operations- A cost based approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Groups of Jobs on a Single Machine / rank
 
Normal rank

Latest revision as of 15:55, 27 June 2024

scientific article; zbMATH DE number 5229850
Language Label Description Also known as
English
Dynamic scheduling of batch-processing machines with non-identical product sizes
scientific article; zbMATH DE number 5229850

    Statements

    Dynamic scheduling of batch-processing machines with non-identical product sizes (English)
    0 references
    24 January 2008
    0 references
    0 references
    scheduling
    0 references
    batch-processing machines
    0 references
    simulation
    0 references
    0 references