Minimizing number of tardy jobs on a batch processing machine with incompatible job families (Q707142): Difference between revisions

From MaRDI portal
Added link to MaRDI 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.1016/j.ejor.2003.10.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2137903142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batching and Scheduling Jobs on Batch and Discrete Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Papers presented at the workshop on discrete algorithms, University of Osnabrück, Germany, July 10-12, 1991 / 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: Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime / 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: Reducibility among Combinatorial 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: Scheduling with agreeable release times and due dates on a batch processing machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / 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

Latest revision as of 18:01, 7 June 2024

scientific article
Language Label Description Also known as
English
Minimizing number of tardy jobs on a batch processing machine with incompatible job families
scientific article

    Statements

    Minimizing number of tardy jobs on a batch processing machine with incompatible job families (English)
    0 references
    0 references
    9 February 2005
    0 references
    0 references
    Scheduling
    0 references
    Batch processing machine
    0 references
    Number of tardy jobs criteria
    0 references
    Dynamic programming
    0 references
    0 references