A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines

DOI10.1007/S11590-015-0859-6MaRDI QIDQ5963694zbMATH OpenOpenAlexFDO

Authors Jianming Dong, Jueliang Hu, Guohui Lin

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

zbMATH Keywords

approximation algorithmbin-packingflowshop schedulingworst-case performance analysisbatch-processing machine

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

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; zbMATH DE number 5732579

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
• A new Lagrangian relaxation algorithm for scheduling dissimilar parallel machines with release dates
• A note on minimizing makespan on a single batch processing machine with nonidentical job sizes
• Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan
• Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Efficient scheduling algorithms for a single batch processing machine
• Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
• Minimizing makespan in a two-machine flowshop scheduling with batching and release time
• Minimizing makespan on a single batch processing machine with nonidentical job sizes
• Minimizing makespan on a single batching machine with release times and non-identical job sizes
• Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
• Optimal two- and three-stage production schedules with set-up time included
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
• Scheduling a single batch processing machine with non-identical job sizes
• Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes
• Scheduling with agreeable release times and due dates on a batch processing machine
• Tighter bounds of the First Fit algorithm for the bin-packing problem

Cited in

(2)

• Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes
• A note on batch scheduling on a two-machine flowshop with machine-dependent processing times

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)