Unbounded parallel-batch scheduling with family jobs and delivery coordination

DOI10.1016/J.IPL.2011.03.014MaRDI QIDQ1944952zbMATH OpenOpenAlexFDO

Authors Jinjiang Yuan, Baoqiang Fan, Shisheng Li

Publication date 28 March 2013

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2011.03.014

zbMATH Keywords

approximation algorithmsparallel-batch schedulingbatch deliveryfamily jobs

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Recommendations

• Unbounded parallel batch scheduling with job delivery to minimize makespan
• Online scheduling of incompatible family jobs with equal length on an unbounded parallel-batch machine with job delivery
• The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
• Online unbounded batch scheduling on parallel machines with delivery times
• Scheduling with families of jobs and delivery coordination under job availability
• Online scheduling on unbounded parallel-batch machines with incompatible job families
• Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
• Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery
• A note on unbounded parallel-batch scheduling
• Unbounded parallel-batch scheduling with drop-line tasks

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Approximation algorithms for two-machine flow shop scheduling with batch setup times
• Complexity results for single-machine problems with positive finish-start time-lags
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Efficient scheduling algorithms for a single batch processing machine
• Integrated Production and Outbound Distribution Scheduling: Review and Extensions
• Integrated Scheduling of Production and Distribution Operations
• Logistics scheduling with batching and transportation
• Machine scheduling with an availability constraint and job delivery coordination
• Machine scheduling with deliveries to multiple customer locations
• Machine scheduling with job delivery coordination
• Machine scheduling with transportation considerations
• On the machine scheduling problem with job delivery coordination
• Open Shop Scheduling to Minimize Finish Time
• Optimal two- and three-stage production schedules with set-up time included
• Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
• Scheduling a batching machine
• Scheduling batches with simultaneous job processing for two-machine shop problems
• Supply Chain Scheduling: Batching and Delivery
• Supply chain scheduling: sequence coordination
• The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan
• The integrated production and transportation scheduling problem for a product with a short lifespan
• The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
• Unbounded parallel batch scheduling with job delivery to minimize makespan

Cited in

(6)

• Integrated scheduling problem on a single bounded batch machine with an unavailability constraint
• The Coordination of Two Parallel Machines Scheduling and Batch Deliveries
• Scheduling with families of jobs and delivery coordination under job availability
• Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery
• Unbounded parallel batch scheduling with job delivery to minimize makespan
• Integrated Job Scheduling with Parallel-Batch Processing and Batch Deliveries

This page was built for publication: Unbounded parallel-batch scheduling with family jobs and delivery coordination

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