Single batch machine scheduling with deliveries

DOI10.1002/nav.21641zbMath1411.90139OpenAlexW1922001975MaRDI QIDQ4632900

Joseph Y.-T. Leung, Kai Li, Ba-Yi Cheng, Shan-Lin Yang

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.21641

zbMATH Keywords

schedulingNP-hardapproximation algorithmspolynomial time algorithmsdeliverybatch machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (8)

Minmizing service span with batch-position-based learning effects ⋮ Single machine lot scheduling to minimize the total weighted (discounted) completion time ⋮ Integrated scheduling on parallel batch processing machines with non-identical capacities ⋮ Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance ⋮ Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system ⋮ Integrated scheduling problem on a single bounded batch machine with an unavailability constraint ⋮ Integrated scheduling on a batch machine to minimize production, inventory and distribution costs ⋮ Integrated optimization of material supplying, manufacturing, and product distribution: models and fast algorithms

This page was built for publication: Single batch machine scheduling with deliveries