A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines (Q5963694): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-015-0859-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2004594161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling algorithm for flow shop with two batch-processing machines and arbitrary 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / 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: Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / 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: A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes / 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: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations / 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: Minimizing makespan on a single batching machine with release times and non-identical job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan in a two-machine flowshop scheduling with batching and release time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new Lagrangian Relaxation Algorithm for scheduling dissimilar parallel machines with release dates / 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: Tighter bounds of the First Fit algorithm for the bin-packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan on a single batch processing machine with nonidentical job sizes / rank
 
Normal rank

Latest revision as of 12:04, 11 July 2024

scientific article; zbMATH DE number 6544383
Language Label Description Also known as
English
A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines
scientific article; zbMATH DE number 6544383

    Statements

    A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines (English)
    0 references
    0 references
    0 references
    0 references
    23 February 2016
    0 references
    0 references
    flowshop scheduling
    0 references
    batch-processing machine
    0 references
    bin-packing
    0 references
    approximation algorithm
    0 references
    worst-case performance analysis
    0 references
    0 references
    0 references