Online Parallel-Batch Scheduling of Learning Effect Jobs with Incompatible Job Families for Prefabricated Components
From MaRDI portal
Publication:6135731
DOI10.1142/s0129626423400030zbMath1518.90027OpenAlexW4315498075MaRDI QIDQ6135731
No author found.
Publication date: 26 August 2023
Published in: Parallel Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129626423400030
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Cites Work
- An order scheduling problem with position-based learning effect
- Online scheduling on unbounded parallel-batch machines with incompatible job families
- Time-dependent scheduling
- Scheduling jobs under decreasing linear deterioration
- Competitive snoopy caching
- Single-machine scheduling with learning considerations
- Scheduling a batching machine
- Complexity of scheduling tasks with time-dependent execution times
- Learning curves for processes generating defects requiring reworks
- Terminal inventory level constraints for online production scheduling
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling problems with a learning effect
- Bicriterion scheduling with truncated learning effects and convex controllable processing times
This page was built for publication: Online Parallel-Batch Scheduling of Learning Effect Jobs with Incompatible Job Families for Prefabricated Components