Unbounded parallel-batch scheduling with drop-line tasks

DOI10.1007/s10951-018-0586-9zbMath1434.90056OpenAlexW2890912558WikidataQ129249629 ScholiaQ129249629MaRDI QIDQ2304116

Jinjiang Yuan, Yuan Gao, Zhigang Wei

Publication date: 6 March 2020

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-018-0586-9

zbMATH Keywords

computational complexityrelease datesparallel-batch schedulingdrop-line tasks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

Mixed batch scheduling on identical machines ⋮ Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs ⋮ Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times ⋮ An Online Scheduling Problem on a Drop-Line Parallel Batch Machine with Delivery Times and Limited Restart

Cites Work

• Unnamed Item
• Bi-criteria scheduling on a single parallel-batch machine
• A note on unbounded parallel-batch scheduling
• Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time
• The coordination of transportation and batching scheduling
• Optimal methods for batch processing problem with makespan and maximum lateness objectives
• Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
• Scheduling a batching machine
• A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
• On scheduling an unbounded batch machine
• Minimizing mean completion time in a batch processing system
• Scheduling with batching: A review
• Unbounded parallel-batching scheduling with two competitive agents
• Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
• The Batch Loading and Scheduling Problem
• Supply Chain Scheduling: Batching and Delivery
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• Single machine parallel batch scheduling subject to precedence constraints
• Scheduling Groups of Jobs on a Single Machine
• Machine scheduling with transportation considerations

This page was built for publication: Unbounded parallel-batch scheduling with drop-line tasks