Improved bounds for batch scheduling with nonidentical job sizes
From MaRDI portal
Publication:4632843
DOI10.1002/nav.21587zbMath1411.90141OpenAlexW1942481402MaRDI QIDQ4632843
Zsolt Tuza, Cecilia Sik Lanyi, György Dósa, Zhiyi Tan, Yujie Yan
Publication date: 2 May 2019
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.21587
Related Items (12)
Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance ⋮ Integrated scheduling problem on a single bounded batch machine with an unavailability constraint ⋮ Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines ⋮ Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities ⋮ Integrated scheduling on a batch machine to minimize production, inventory and distribution costs ⋮ Scheduling jobs with sizes and delivery times on identical parallel batch machines ⋮ Integrated optimization of material supplying, manufacturing, and product distribution: models and fast algorithms ⋮ Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery ⋮ Integrated scheduling of production and distribution for manufacturers with parallel batching facilities ⋮ Batch scheduling of nonidentical job sizes with minsum criteria ⋮ Capacitated vehicle routing problem on line with unsplittable demands ⋮ A tight approximation algorithm for multi-vehicle CVRP with unsplittable demands on a line
This page was built for publication: Improved bounds for batch scheduling with nonidentical job sizes
