A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions

DOI10.3934/ERA.2022213MaRDI QIDQ2699097zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 26 April 2023

Published in Electronic Research Archive (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3934/era.2022213

zbMATH Keywords

inclusive processing set restrictionsmaximum delivery completion timepolynomial time approximation schemeschedulingunbounded batch machines

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Recommendations

• scientific article; zbMATH DE number 2080976
• Scheduling jobs with release dates on parallel batch processing machines
• Scheduling jobs with sizes and delivery times on identical parallel batch machines
• Efficient approximation schemes for scheduling problems with release dates and delivery times
• Online unbounded batch scheduling on parallel machines with delivery times

Cites work

• A POSTERIOR COMPETITIVENESS FOR LIST SCHEDULING ALGORITHM ON MACHINES WITH ELIGIBILITY CONSTRAINTS
• A survey of scheduling with parallel batch (p-batch) processing
• Efficient approximation schemes for scheduling problems with release dates and delivery times
• scientific article; zbMATH DE number 1219584 (Why is no real title available?)
• scientific article; zbMATH DE number 2109192 (Why is no real title available?)
• Improved dynamic programs for some batching problems involving the maximum lateness criterion
• Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
• Online batch scheduling on parallel machines with delivery times
• Online unbounded batch scheduling on parallel machines with delivery times
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel machine scheduling with job assignment restrictions
• Parameterized complexity of machine scheduling: 15 open problems
• Scheduling a batching machine
• Scheduling an Unbounded Batch Machine to Minimize Maximum Lateness
• Scheduling and fixed-parameter tractability
• Scheduling jobs with release dates on parallel batch processing machines
• Scheduling parallel machines with inclusive processing set restrictions
• Scheduling parallel machines with inclusive processing set restrictions and job release times
• Scheduling with batching: A review
• Task Scheduling on a Multiprocessor System with Independent Memories

Cited in

(3)

• Approximate and robust bounded job start scheduling for Royal Mail delivery offices
• Approximating bounded job start scheduling with application in Royal Mail deliveries under uncertainty
• Scheduling with tree-hierarchical processing set restrictions

This page was built for publication: A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions

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