A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes (Q941534): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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.1016/j.cor.2006.07.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2063271630 / 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: Efficient scheduling algorithms for a single batch processing machine / 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: Scheduling a batching machine / 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 batch processing machines with incompatible job families / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Batch Loading and Scheduling Problem / 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 total completion time on a batch processing machine with job families / 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 the makespan on a batch machine with non-identical job sizes: An exact procedure / 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: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness / 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: Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families / 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: Scheduling with Deadlines and Loss Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic Algorithms and Random Keys for Sequencing and Optimization / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:49, 28 June 2024

scientific article
Language Label Description Also known as
English
A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
scientific article

    Statements

    A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes (English)
    0 references
    0 references
    0 references
    1 September 2008
    0 references
    0 references
    simulated annealing
    0 references
    0 references