Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes (Q693407): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
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.1016/j.apm.2011.09.061 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2026422974 / 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: Minimizing makespan on a single batch processing machine with nonidentical job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on minimizing makespan on a single batch processing machine with nonidentical job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan on a single batching machine with release times and non-identical job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithms to minimize the weighted number of late jobs on a single machine. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes / 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: Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach / 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: Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank

Latest revision as of 00:02, 6 July 2024

scientific article
Language Label Description Also known as
English
Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
scientific article

    Statements

    Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 December 2012
    0 references
    0 references
    batch scheduling
    0 references
    non-identical job sizes
    0 references
    parallel machines
    0 references
    approximation algorithm
    0 references
    0 references