A note on minimizing makespan on a single batch processing machine with nonidentical job sizes

DOI10.1016/J.TCS.2009.02.014zbMATH Open1177.90166OpenAlexW2092036837MaRDI QIDQ1029348FDOQ1029348

Ali Husseinzadeh Kashan, S. M. T. Fatemi Ghomi, Behrooz Karimi

Publication date: 10 July 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.02.014

Recommendations

• Minimizing makespan on a single batch processing machine with nonidentical job sizes
• Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
• Minimizing makespan on a single batching machine with release times and non-identical job sizes
• On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes
• Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
• Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
• Minimising makespan for two batch-processing machines with non-identical job sizes in job shop
• An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes

zbMATH Keywords

worst-case ratio

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Minimizing makespan on a single batch processing machine with nonidentical job sizes
• Scheduling a single batch processing machine with non-identical job sizes
• A tight lower bound for optimal bin packing
• Scheduling on a batch machine with job compatibilities

Cited In (9)

• Minimising makespan for two batch-processing machines with non-identical job sizes in job shop
• Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes
• Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
• An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes
• A constraint programming approach for a batch processing problem with non-identical job sizes
• Minimizing makespan on a single batch processing machine with nonidentical job sizes
• On minimizing the makespan when some jobs cannot be assigned on the same machine
• On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes
• A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines

This page was built for publication: A note on minimizing makespan on a single batch processing machine with nonidentical job sizes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1029348)