A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines
DOI10.1007/S11590-015-0859-6zbMATH Open1337.90024OpenAlexW2004594161MaRDI QIDQ5963694FDOQ5963694
Jueliang Hu, Guohui Lin, Jianming Dong
Publication date: 23 February 2016
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-015-0859-6
Recommendations
- An approximation algorithm for scheduling batch processing machines with non-identical job sizes in flow shop
- Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes
- Approximation algorithms for two-machine flow shop scheduling with batch setup times
- Two-stage flowshop scheduling problems with identical and batch processors
- scientific article
approximation algorithmbin-packingflowshop schedulingworst-case performance analysisbatch-processing machine
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Optimal two- and three-stage production schedules with set-up time included
- Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Efficient scheduling algorithms for a single batch processing machine
- Minimizing makespan on a single batching machine with release times and non-identical job sizes
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- Scheduling a single batch processing machine with non-identical job sizes
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
- A note on minimizing makespan on a single batch processing machine with nonidentical job sizes
- Scheduling with agreeable release times and due dates on a batch processing machine
- A new Lagrangian Relaxation Algorithm for scheduling dissimilar parallel machines with release dates
- Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan
- Tighter bounds of the First Fit algorithm for the bin-packing problem
- Minimizing makespan in a two-machine flowshop scheduling with batching and release time
Cited In (1)
This page was built for publication: A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963694)
