Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery
From MaRDI portal
Publication:2039713
DOI10.1007/978-3-030-57602-8_47zbMath1470.90027OpenAlexW3047719676MaRDI QIDQ2039713
Publication date: 5 July 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-57602-8_47
Related Items (4)
Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance ⋮ Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time ⋮ Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions ⋮ Modeling and solving the waste valorization production and distribution scheduling problem
Cites Work
- Improved algorithms for two single machine scheduling problems
- On the machine scheduling problem with job delivery coordination
- Unbounded parallel batch scheduling with job delivery to minimize makespan
- Integrated scheduling of production and distribution for manufacturers with parallel batching facilities
- Machine scheduling with job delivery coordination
- Unbounded parallel-batch scheduling with family jobs and delivery coordination
- Machine scheduling with an availability constraint
- Integrated Production and Outbound Distribution Scheduling: Review and Extensions
- Machine scheduling with an availability constraint and job delivery coordination
- Integrated Scheduling of Production and Distribution Operations
- Supply Chain Scheduling: Batching and Delivery
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- Improved bounds for batch scheduling with nonidentical job sizes
- Machine scheduling with transportation considerations
This page was built for publication: Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery
