Online Parallel-Batch Scheduling of Learning Effect Jobs with Incompatible Job Families for Prefabricated Components

DOI10.1142/S0129626423400030MaRDI QIDQ6135731zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

online schedulinglearning effectjob familiesparallel-batchprefabricated components

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Online scheduling on unbounded parallel-batch machines with incompatible job families
• An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan
• Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval
• Online scheduling of incompatible family jobs with equal length on an unbounded parallel-batch machine with job delivery
• Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs
• An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities
• On-line algorithms for incompatible job families on parallel machines scheduling with lookahead
• Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
• Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs
• scientific article; zbMATH DE number 7235424

Cites work

• 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
• An order scheduling problem with position-based learning effect
• Bicriterion scheduling with truncated learning effects and convex controllable processing times
• Competitive snoopy caching
• Complexity of scheduling tasks with time-dependent execution times
• Learning curves for processes generating defects requiring reworks
• Online scheduling on unbounded parallel-batch machines with incompatible job families
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling a batching machine
• Scheduling jobs under decreasing linear deterioration
• Scheduling problems with a learning effect
• Single-machine scheduling with learning considerations
• Terminal inventory level constraints for online production scheduling
• Time-dependent scheduling

This page was built for publication: Online Parallel-Batch Scheduling of Learning Effect Jobs with Incompatible Job Families for Prefabricated Components

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